./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.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_2.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 705ad2bbbe3c7f3c6f5cd876d831ecd184de0c7834e69dbbbb193e9c96714a26 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:20,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:20,271 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:20,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:20,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:20,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:20,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:20,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:20,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:20,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:20,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:20,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:20,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:20,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:20,299 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:20,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:20,299 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:20,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:20,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:20,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:20,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:20,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:20,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:20,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:20,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:20,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:20,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:20,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:20,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:20,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:20,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:22:20,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:22:20,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:20,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:20,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:20,302 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 -> 705ad2bbbe3c7f3c6f5cd876d831ecd184de0c7834e69dbbbb193e9c96714a26 [2025-04-29 11:22:20,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:20,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:20,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:20,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:20,552 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:20,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.c [2025-04-29 11:22:21,838 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419e78b44/e095783b193646948e9c42cbc710fc0b/FLAG776172adc [2025-04-29 11:22:22,080 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:22,080 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-bftpd/bftpd_2.c [2025-04-29 11:22:22,086 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:22,087 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:22,093 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419e78b44/e095783b193646948e9c42cbc710fc0b/FLAG776172adc [2025-04-29 11:22:22,839 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419e78b44/e095783b193646948e9c42cbc710fc0b [2025-04-29 11:22:22,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:22,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:22,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:22,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:22,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:22,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:22" (1/1) ... [2025-04-29 11:22:22,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2a1da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:22, skipping insertion in model container [2025-04-29 11:22:22,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:22" (1/1) ... [2025-04-29 11:22:22,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:22,976 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:22,979 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:22,989 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:23,013 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:23,025 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:23,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:23 WrapperNode [2025-04-29 11:22:23,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:23,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:23,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:23,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:23,031 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:23" (1/1) ... [2025-04-29 11:22:23,042 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:23" (1/1) ... [2025-04-29 11:22:23,060 INFO L138 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-04-29 11:22:23,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:23,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:23,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:23,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:23,067 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:23" (1/1) ... [2025-04-29 11:22:23,067 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:23" (1/1) ... [2025-04-29 11:22:23,069 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:23" (1/1) ... [2025-04-29 11:22:23,083 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 6, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2025-04-29 11:22:23,083 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:23" (1/1) ... [2025-04-29 11:22:23,083 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:23" (1/1) ... [2025-04-29 11:22:23,087 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:23" (1/1) ... [2025-04-29 11:22:23,087 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:23" (1/1) ... [2025-04-29 11:22:23,089 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:23" (1/1) ... [2025-04-29 11:22:23,094 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:23" (1/1) ... [2025-04-29 11:22:23,095 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:23" (1/1) ... [2025-04-29 11:22:23,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:23,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:23,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:23,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:23,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:23" (1/1) ... [2025-04-29 11:22:23,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:23,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:23,124 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:23,126 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:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-04-29 11:22:23,142 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:22:23,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:22:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:22:23,216 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:22:23,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:22:23,390 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-29 11:22:23,390 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:22:23,398 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:22:23,400 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:22:23,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:23 BoogieIcfgContainer [2025-04-29 11:22:23,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:22:23,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:22:23,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:22:23,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:22:23,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:22" (1/3) ... [2025-04-29 11:22:23,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f0767c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:23, skipping insertion in model container [2025-04-29 11:22:23,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:23" (2/3) ... [2025-04-29 11:22:23,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f0767c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:23, skipping insertion in model container [2025-04-29 11:22:23,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:23" (3/3) ... [2025-04-29 11:22:23,408 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.c [2025-04-29 11:22:23,417 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:22:23,419 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.c that has 2 procedures, 61 locations, 72 edges, 1 initial locations, 1 loop locations, and 20 error locations. [2025-04-29 11:22:23,450 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:22:23,460 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;@5d68e62f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:22:23,460 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-29 11:22:23,464 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:23,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:23,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:23,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:23,469 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:23,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash -920361850, now seen corresponding path program 1 times [2025-04-29 11:22:23,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:23,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305648656] [2025-04-29 11:22:23,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:23,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:23,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:23,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:23,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:23,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,696 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:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:23,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305648656] [2025-04-29 11:22:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305648656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:23,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:23,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:23,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563061205] [2025-04-29 11:22:23,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:23,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:23,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:23,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:23,721 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:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:23,858 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2025-04-29 11:22:23,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:23,860 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:23,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:23,865 INFO L225 Difference]: With dead ends: 124 [2025-04-29 11:22:23,865 INFO L226 Difference]: Without dead ends: 118 [2025-04-29 11:22:23,866 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:23,868 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 148 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:23,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-29 11:22:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2025-04-29 11:22:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-29 11:22:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2025-04-29 11:22:23,896 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 6 [2025-04-29 11:22:23,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:23,896 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2025-04-29 11:22:23,896 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:23,897 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2025-04-29 11:22:23,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:23,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:23,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:23,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:22:23,898 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:23,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash -920361849, now seen corresponding path program 1 times [2025-04-29 11:22:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:23,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170319270] [2025-04-29 11:22:23,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:23,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:23,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:23,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:23,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:24,011 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:24,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:24,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170319270] [2025-04-29 11:22:24,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170319270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:24,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:24,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:24,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740767551] [2025-04-29 11:22:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:24,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:24,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:24,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:24,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:24,013 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:24,113 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2025-04-29 11:22:24,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:24,114 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:24,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:24,116 INFO L225 Difference]: With dead ends: 191 [2025-04-29 11:22:24,117 INFO L226 Difference]: Without dead ends: 191 [2025-04-29 11:22:24,117 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:24,118 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 82 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:24,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 204 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-29 11:22:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 168. [2025-04-29 11:22:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2025-04-29 11:22:24,149 INFO L79 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 6 [2025-04-29 11:22:24,149 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:24,149 INFO L485 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2025-04-29 11:22:24,149 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:24,149 INFO L278 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2025-04-29 11:22:24,149 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:22:24,149 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:24,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:24,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:22:24,149 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:24,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1533553699, now seen corresponding path program 1 times [2025-04-29 11:22:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:24,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569532036] [2025-04-29 11:22:24,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:24,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:22:24,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:22:24,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:24,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:24,329 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:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:24,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569532036] [2025-04-29 11:22:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569532036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:24,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:24,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519858818] [2025-04-29 11:22:24,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:24,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:24,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:24,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:24,332 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:24,456 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2025-04-29 11:22:24,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:24,457 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:24,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:24,458 INFO L225 Difference]: With dead ends: 208 [2025-04-29 11:22:24,459 INFO L226 Difference]: Without dead ends: 208 [2025-04-29 11:22:24,459 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:24,460 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:24,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 157 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-04-29 11:22:24,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 171. [2025-04-29 11:22:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2025-04-29 11:22:24,476 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 7 [2025-04-29 11:22:24,476 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:24,476 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2025-04-29 11:22:24,476 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:24,476 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2025-04-29 11:22:24,477 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:22:24,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:24,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:24,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:22:24,477 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:24,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 295524454, now seen corresponding path program 1 times [2025-04-29 11:22:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:24,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152745781] [2025-04-29 11:22:24,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:24,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:22:24,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:22:24,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:24,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:24,645 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:24,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:24,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152745781] [2025-04-29 11:22:24,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152745781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:24,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:24,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78208728] [2025-04-29 11:22:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:24,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:24,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:24,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:24,647 INFO L87 Difference]: Start difference. First operand 171 states and 264 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:24,753 INFO L93 Difference]: Finished difference Result 193 states and 266 transitions. [2025-04-29 11:22:24,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:24,754 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:24,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:24,755 INFO L225 Difference]: With dead ends: 193 [2025-04-29 11:22:24,755 INFO L226 Difference]: Without dead ends: 193 [2025-04-29 11:22:24,755 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:24,755 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:24,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 201 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-29 11:22:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 171. [2025-04-29 11:22:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2025-04-29 11:22:24,767 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 8 [2025-04-29 11:22:24,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:24,767 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2025-04-29 11:22:24,767 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:24,767 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2025-04-29 11:22:24,767 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:24,768 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:24,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:24,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:22:24,770 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:24,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash 571323525, now seen corresponding path program 1 times [2025-04-29 11:22:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:24,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906497033] [2025-04-29 11:22:24,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:24,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:24,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:24,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:24,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:24,826 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:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:24,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906497033] [2025-04-29 11:22:24,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906497033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:24,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:24,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390781957] [2025-04-29 11:22:24,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:24,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:24,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:24,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:24,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:24,828 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:24,909 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2025-04-29 11:22:24,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:24,909 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:24,909 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:24,910 INFO L225 Difference]: With dead ends: 250 [2025-04-29 11:22:24,910 INFO L226 Difference]: Without dead ends: 250 [2025-04-29 11:22:24,910 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:24,911 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 133 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:24,911 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 190 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-29 11:22:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2025-04-29 11:22:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 312 transitions. [2025-04-29 11:22:24,925 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 312 transitions. Word has length 9 [2025-04-29 11:22:24,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:24,925 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 312 transitions. [2025-04-29 11:22:24,925 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:24,925 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 312 transitions. [2025-04-29 11:22:24,926 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:22:24,926 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:24,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:24,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:22:24,926 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:24,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash 531160136, now seen corresponding path program 1 times [2025-04-29 11:22:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:24,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93679146] [2025-04-29 11:22:24,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:24,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:22:24,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:22:24,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:24,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:24,983 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:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:24,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93679146] [2025-04-29 11:22:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93679146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:24,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327730037] [2025-04-29 11:22:24,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:24,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:24,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:24,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:24,985 INFO L87 Difference]: Start difference. First operand 207 states and 312 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:25,053 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2025-04-29 11:22:25,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:25,053 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:25,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:25,054 INFO L225 Difference]: With dead ends: 245 [2025-04-29 11:22:25,054 INFO L226 Difference]: Without dead ends: 245 [2025-04-29 11:22:25,054 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:25,055 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:25,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 211 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-29 11:22:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2025-04-29 11:22:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2025-04-29 11:22:25,066 INFO L79 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 10 [2025-04-29 11:22:25,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:25,066 INFO L485 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2025-04-29 11:22:25,066 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:25,066 INFO L278 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2025-04-29 11:22:25,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:22:25,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:25,066 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:25,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:22:25,067 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:25,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:25,067 INFO L85 PathProgramCache]: Analyzing trace with hash 738472334, now seen corresponding path program 1 times [2025-04-29 11:22:25,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:25,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727044247] [2025-04-29 11:22:25,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:25,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:25,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:25,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:25,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:25,183 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:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:25,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727044247] [2025-04-29 11:22:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727044247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:25,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572425670] [2025-04-29 11:22:25,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:25,186 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:25,188 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:25,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:25,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:25,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:25,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:25,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:25,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:25,408 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:25,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:25,515 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:25,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572425670] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:25,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:25,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-04-29 11:22:25,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677959359] [2025-04-29 11:22:25,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:25,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:22:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:25,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:22:25,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:22:25,517 INFO L87 Difference]: Start difference. First operand 217 states and 325 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:25,672 INFO L93 Difference]: Finished difference Result 240 states and 324 transitions. [2025-04-29 11:22:25,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:25,672 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:25,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:25,674 INFO L225 Difference]: With dead ends: 240 [2025-04-29 11:22:25,675 INFO L226 Difference]: Without dead ends: 240 [2025-04-29 11:22:25,675 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:25,675 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 233 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:25,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 384 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-04-29 11:22:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2025-04-29 11:22:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 201 states have internal predecessors, (274), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 319 transitions. [2025-04-29 11:22:25,688 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 319 transitions. Word has length 14 [2025-04-29 11:22:25,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:25,688 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 319 transitions. [2025-04-29 11:22:25,688 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:25,688 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 319 transitions. [2025-04-29 11:22:25,688 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:22:25,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:25,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:25,698 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:25,889 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:25,889 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:25,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1417805820, now seen corresponding path program 1 times [2025-04-29 11:22:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:25,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358064659] [2025-04-29 11:22:25,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:25,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:22:25,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:22:25,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:25,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,008 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:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:26,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358064659] [2025-04-29 11:22:26,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358064659] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:26,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150776905] [2025-04-29 11:22:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:26,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:26,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:26,012 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:26,013 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:26,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:22:26,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:22:26,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:26,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:26,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:26,203 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:26,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:26,249 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:26,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150776905] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:26,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:26,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-29 11:22:26,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493545826] [2025-04-29 11:22:26,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:26,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:22:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:26,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:22:26,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:22:26,251 INFO L87 Difference]: Start difference. First operand 220 states and 319 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:26,453 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2025-04-29 11:22:26,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:22:26,455 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:26,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:26,456 INFO L225 Difference]: With dead ends: 258 [2025-04-29 11:22:26,456 INFO L226 Difference]: Without dead ends: 258 [2025-04-29 11:22:26,457 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:26,457 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 124 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:26,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 356 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-29 11:22:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 228. [2025-04-29 11:22:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 190 states have (on average 1.5) internal successors, (285), 209 states have internal predecessors, (285), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2025-04-29 11:22:26,467 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 15 [2025-04-29 11:22:26,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:26,467 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2025-04-29 11:22:26,467 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:26,467 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2025-04-29 11:22:26,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:26,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:26,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:26,477 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:22:26,668 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:26,668 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:26,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1002307501, now seen corresponding path program 1 times [2025-04-29 11:22:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:26,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282192160] [2025-04-29 11:22:26,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:26,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:26,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:26,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:26,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,822 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:26,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:26,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282192160] [2025-04-29 11:22:26,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282192160] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:26,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151039971] [2025-04-29 11:22:26,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:26,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:26,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:26,825 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:26,826 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:26,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:26,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:26,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:26,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:22:26,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:27,034 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:27,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:27,143 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:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151039971] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:27,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-04-29 11:22:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382298055] [2025-04-29 11:22:27,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:27,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:27,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:27,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:22:27,145 INFO L87 Difference]: Start difference. First operand 228 states and 330 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:27,538 INFO L93 Difference]: Finished difference Result 385 states and 531 transitions. [2025-04-29 11:22:27,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:22:27,539 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:27,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:27,540 INFO L225 Difference]: With dead ends: 385 [2025-04-29 11:22:27,540 INFO L226 Difference]: Without dead ends: 385 [2025-04-29 11:22:27,541 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:27,541 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 224 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:27,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 617 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:22:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-04-29 11:22:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 323. [2025-04-29 11:22:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 279 states have (on average 1.5412186379928314) internal successors, (430), 298 states have internal predecessors, (430), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2025-04-29 11:22:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2025-04-29 11:22:27,557 INFO L79 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 16 [2025-04-29 11:22:27,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:27,557 INFO L485 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2025-04-29 11:22:27,558 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:27,558 INFO L278 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2025-04-29 11:22:27,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:27,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:27,558 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:27,564 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:27,759 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:27,759 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:27,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920271, now seen corresponding path program 1 times [2025-04-29 11:22:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:27,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812453653] [2025-04-29 11:22:27,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:27,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:27,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:27,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:27,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:27,815 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:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:27,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812453653] [2025-04-29 11:22:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812453653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:27,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377938243] [2025-04-29 11:22:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:27,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:27,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:27,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:27,817 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:27,839 INFO L93 Difference]: Finished difference Result 334 states and 480 transitions. [2025-04-29 11:22:27,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:27,840 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:27,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:27,841 INFO L225 Difference]: With dead ends: 334 [2025-04-29 11:22:27,841 INFO L226 Difference]: Without dead ends: 334 [2025-04-29 11:22:27,841 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:27,841 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:27,842 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 112 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-29 11:22:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 325. [2025-04-29 11:22:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 284 states have (on average 1.528169014084507) internal successors, (434), 305 states have internal predecessors, (434), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) [2025-04-29 11:22:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 478 transitions. [2025-04-29 11:22:27,854 INFO L79 Accepts]: Start accepts. Automaton has 325 states and 478 transitions. Word has length 18 [2025-04-29 11:22:27,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:27,854 INFO L485 AbstractCegarLoop]: Abstraction has 325 states and 478 transitions. [2025-04-29 11:22:27,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:27,854 INFO L278 IsEmpty]: Start isEmpty. Operand 325 states and 478 transitions. [2025-04-29 11:22:27,854 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:22:27,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:27,854 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:27,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:22:27,855 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:27,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2036164058, now seen corresponding path program 1 times [2025-04-29 11:22:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:27,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196809018] [2025-04-29 11:22:27,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:27,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:22:27,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:22:27,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:27,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:27,900 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:27,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:27,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196809018] [2025-04-29 11:22:27,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196809018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:27,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:27,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:27,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602434931] [2025-04-29 11:22:27,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:27,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:27,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:27,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:27,905 INFO L87 Difference]: Start difference. First operand 325 states and 478 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:27,912 INFO L93 Difference]: Finished difference Result 251 states and 356 transitions. [2025-04-29 11:22:27,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:27,913 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:27,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:27,914 INFO L225 Difference]: With dead ends: 251 [2025-04-29 11:22:27,914 INFO L226 Difference]: Without dead ends: 251 [2025-04-29 11:22:27,914 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:27,915 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:27,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-04-29 11:22:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-04-29 11:22:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 216 states have (on average 1.5092592592592593) internal successors, (326), 236 states have internal predecessors, (326), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-04-29 11:22:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 356 transitions. [2025-04-29 11:22:27,924 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 356 transitions. Word has length 25 [2025-04-29 11:22:27,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:27,924 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 356 transitions. [2025-04-29 11:22:27,925 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:27,925 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 356 transitions. [2025-04-29 11:22:27,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:22:27,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:27,925 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:27,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:22:27,925 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:27,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash -72255190, now seen corresponding path program 1 times [2025-04-29 11:22:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:27,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927622320] [2025-04-29 11:22:27,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:27,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:22:27,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:22:27,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:27,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:28,086 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:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:28,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927622320] [2025-04-29 11:22:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927622320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:28,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116009019] [2025-04-29 11:22:28,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:28,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:28,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:28,088 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:28,090 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:28,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:22:28,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:22:28,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:28,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:28,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:22:28,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:28,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:28,377 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:28,430 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:28,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:28,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116009019] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:28,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:28,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-04-29 11:22:28,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515109076] [2025-04-29 11:22:28,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:28,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:22:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:28,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:22:28,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:22:28,556 INFO L87 Difference]: Start difference. First operand 251 states and 356 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:28,904 INFO L93 Difference]: Finished difference Result 284 states and 381 transitions. [2025-04-29 11:22:28,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:22:28,905 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:28,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:28,906 INFO L225 Difference]: With dead ends: 284 [2025-04-29 11:22:28,906 INFO L226 Difference]: Without dead ends: 284 [2025-04-29 11:22:28,907 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:22:28,907 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 363 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:28,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 183 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-29 11:22:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2025-04-29 11:22:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.4553191489361703) internal successors, (342), 259 states have internal predecessors, (342), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-04-29 11:22:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2025-04-29 11:22:28,914 INFO L79 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 27 [2025-04-29 11:22:28,915 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:28,915 INFO L485 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2025-04-29 11:22:28,915 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:28,915 INFO L278 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2025-04-29 11:22:28,915 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:22:28,915 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:28,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:28,922 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:29,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:29,116 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:29,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1506398064, now seen corresponding path program 1 times [2025-04-29 11:22:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:29,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907525099] [2025-04-29 11:22:29,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:29,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:22:29,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:22:29,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:29,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:29,192 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:29,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:29,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907525099] [2025-04-29 11:22:29,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907525099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:29,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112773465] [2025-04-29 11:22:29,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:29,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:29,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:29,195 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:29,196 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:29,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:22:29,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:22:29,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:29,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:29,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:29,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:29,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:29,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112773465] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:29,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:22:29,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-04-29 11:22:29,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131345091] [2025-04-29 11:22:29,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:29,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:29,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:29,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:29,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:29,345 INFO L87 Difference]: Start difference. First operand 274 states and 376 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:29,407 INFO L93 Difference]: Finished difference Result 293 states and 391 transitions. [2025-04-29 11:22:29,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:22:29,407 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:29,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:29,408 INFO L225 Difference]: With dead ends: 293 [2025-04-29 11:22:29,408 INFO L226 Difference]: Without dead ends: 293 [2025-04-29 11:22:29,408 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:29,409 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 68 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:29,409 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 186 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-04-29 11:22:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 282. [2025-04-29 11:22:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 243 states have (on average 1.440329218106996) internal successors, (350), 267 states have internal predecessors, (350), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-04-29 11:22:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 384 transitions. [2025-04-29 11:22:29,415 INFO L79 Accepts]: Start accepts. Automaton has 282 states and 384 transitions. Word has length 28 [2025-04-29 11:22:29,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:29,415 INFO L485 AbstractCegarLoop]: Abstraction has 282 states and 384 transitions. [2025-04-29 11:22:29,416 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:29,416 INFO L278 IsEmpty]: Start isEmpty. Operand 282 states and 384 transitions. [2025-04-29 11:22:29,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:22:29,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:29,416 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:29,422 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:22:29,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:22:29,617 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:29,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash -717762487, now seen corresponding path program 1 times [2025-04-29 11:22:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:29,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455691443] [2025-04-29 11:22:29,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:29,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:29,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:22:29,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:22:29,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:29,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:29,931 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:29,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:29,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455691443] [2025-04-29 11:22:29,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455691443] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:29,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193657641] [2025-04-29 11:22:29,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:29,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:29,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:29,933 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:29,935 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:29,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:22:29,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:22:29,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:29,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:29,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:22:29,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:30,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:30,197 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:30,272 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:30,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193657641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:30,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:30,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2025-04-29 11:22:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752147641] [2025-04-29 11:22:30,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:30,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:22:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:30,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:22:30,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:30,383 INFO L87 Difference]: Start difference. First operand 282 states and 384 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:30,733 INFO L93 Difference]: Finished difference Result 289 states and 383 transitions. [2025-04-29 11:22:30,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:22:30,733 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:30,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:30,734 INFO L225 Difference]: With dead ends: 289 [2025-04-29 11:22:30,734 INFO L226 Difference]: Without dead ends: 289 [2025-04-29 11:22:30,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:22:30,735 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 302 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:30,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 258 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-04-29 11:22:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 282. [2025-04-29 11:22:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 243 states have (on average 1.4238683127572016) internal successors, (346), 267 states have internal predecessors, (346), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-04-29 11:22:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 380 transitions. [2025-04-29 11:22:30,741 INFO L79 Accepts]: Start accepts. Automaton has 282 states and 380 transitions. Word has length 29 [2025-04-29 11:22:30,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:30,741 INFO L485 AbstractCegarLoop]: Abstraction has 282 states and 380 transitions. [2025-04-29 11:22:30,741 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:30,741 INFO L278 IsEmpty]: Start isEmpty. Operand 282 states and 380 transitions. [2025-04-29 11:22:30,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:22:30,741 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:30,742 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:30,747 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:30,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:30,943 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:30,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -775800574, now seen corresponding path program 1 times [2025-04-29 11:22:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:30,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127749707] [2025-04-29 11:22:30,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:30,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:30,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:30,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:30,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:31,051 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:31,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:31,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127749707] [2025-04-29 11:22:31,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127749707] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:31,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468920791] [2025-04-29 11:22:31,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:31,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:31,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:31,054 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:31,055 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:31,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:31,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:31,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:31,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:22:31,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:31,135 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:31,173 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:31,173 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:31,209 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:31,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:31,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468920791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:31,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:31,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-04-29 11:22:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334149602] [2025-04-29 11:22:31,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:31,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:22:31,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:31,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:22:31,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2025-04-29 11:22:31,247 INFO L87 Difference]: Start difference. First operand 282 states and 380 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:22:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:31,520 INFO L93 Difference]: Finished difference Result 407 states and 509 transitions. [2025-04-29 11:22:31,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:22:31,520 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:31,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:31,522 INFO L225 Difference]: With dead ends: 407 [2025-04-29 11:22:31,522 INFO L226 Difference]: Without dead ends: 407 [2025-04-29 11:22:31,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=394, Unknown=1, NotChecked=44, Total=600 [2025-04-29 11:22:31,522 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 345 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:31,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 351 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 271 Invalid, 0 Unknown, 167 Unchecked, 0.1s Time] [2025-04-29 11:22:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-04-29 11:22:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 362. [2025-04-29 11:22:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 320 states have (on average 1.378125) internal successors, (441), 345 states have internal predecessors, (441), 8 states have call successors, (8), 8 states have call predecessors, (8), 16 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2025-04-29 11:22:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 474 transitions. [2025-04-29 11:22:31,529 INFO L79 Accepts]: Start accepts. Automaton has 362 states and 474 transitions. Word has length 30 [2025-04-29 11:22:31,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:31,529 INFO L485 AbstractCegarLoop]: Abstraction has 362 states and 474 transitions. [2025-04-29 11:22:31,529 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:31,529 INFO L278 IsEmpty]: Start isEmpty. Operand 362 states and 474 transitions. [2025-04-29 11:22:31,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:22:31,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:31,529 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:31,535 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:31,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:31,734 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:31,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1719986027, now seen corresponding path program 1 times [2025-04-29 11:22:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:31,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657707531] [2025-04-29 11:22:31,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:31,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:22:31,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:22:31,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:31,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:31,865 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:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:31,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657707531] [2025-04-29 11:22:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657707531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:31,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087961561] [2025-04-29 11:22:31,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:31,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:31,868 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:31,869 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:31,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:22:31,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:22:31,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:31,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:22:31,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:31,971 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:31,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:31,994 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:32,046 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:32,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087961561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:32,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-04-29 11:22:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208472243] [2025-04-29 11:22:32,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:32,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:32,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:32,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=247, Unknown=1, NotChecked=32, Total=342 [2025-04-29 11:22:32,132 INFO L87 Difference]: Start difference. First operand 362 states and 474 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:32,571 INFO L93 Difference]: Finished difference Result 428 states and 524 transitions. [2025-04-29 11:22:32,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:22:32,572 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:32,572 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:32,573 INFO L225 Difference]: With dead ends: 428 [2025-04-29 11:22:32,573 INFO L226 Difference]: Without dead ends: 428 [2025-04-29 11:22:32,573 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=845, Unknown=1, NotChecked=64, Total=1190 [2025-04-29 11:22:32,574 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 615 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:32,574 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 323 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 301 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2025-04-29 11:22:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-04-29 11:22:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 378. [2025-04-29 11:22:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 335 states have (on average 1.3850746268656717) internal successors, (464), 361 states have internal predecessors, (464), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-29 11:22:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 493 transitions. [2025-04-29 11:22:32,581 INFO L79 Accepts]: Start accepts. Automaton has 378 states and 493 transitions. Word has length 31 [2025-04-29 11:22:32,581 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:32,581 INFO L485 AbstractCegarLoop]: Abstraction has 378 states and 493 transitions. [2025-04-29 11:22:32,581 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:32,582 INFO L278 IsEmpty]: Start isEmpty. Operand 378 states and 493 transitions. [2025-04-29 11:22:32,582 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:22:32,582 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:32,582 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:32,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:22:32,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:22:32,784 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:22:32,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:32,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1104147249, now seen corresponding path program 1 times [2025-04-29 11:22:32,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:32,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356312443] [2025-04-29 11:22:32,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:32,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:22:32,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:22:32,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:32,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:32,930 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:32,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:32,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356312443] [2025-04-29 11:22:32,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356312443] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:32,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650883771] [2025-04-29 11:22:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:32,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:32,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:32,932 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:32,933 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:32,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:22:32,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:22:32,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:32,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:32,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:22:32,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:33,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:33,141 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:33,234 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:33,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:33,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650883771] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:33,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:33,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-04-29 11:22:33,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198723743] [2025-04-29 11:22:33,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:33,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:22:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:33,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:22:33,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:33,366 INFO L87 Difference]: Start difference. First operand 378 states and 493 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:33,752 INFO L93 Difference]: Finished difference Result 395 states and 493 transitions. [2025-04-29 11:22:33,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:22:33,752 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:33,752 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:33,753 INFO L225 Difference]: With dead ends: 395 [2025-04-29 11:22:33,753 INFO L226 Difference]: Without dead ends: 395 [2025-04-29 11:22:33,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:22:33,754 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 374 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:33,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 286 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-04-29 11:22:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 377. [2025-04-29 11:22:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 337 states have (on average 1.3264094955489614) internal successors, (447), 360 states have internal predecessors, (447), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-29 11:22:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 476 transitions. [2025-04-29 11:22:33,760 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 476 transitions. Word has length 35 [2025-04-29 11:22:33,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:33,761 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 476 transitions. [2025-04-29 11:22:33,761 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:33,761 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 476 transitions. [2025-04-29 11:22:33,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:22:33,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:33,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:33,770 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:33,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:22:33,962 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:33,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1181916468, now seen corresponding path program 1 times [2025-04-29 11:22:33,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:33,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968546406] [2025-04-29 11:22:33,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:33,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:22:33,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:22:33,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:33,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:33,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:33,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968546406] [2025-04-29 11:22:33,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968546406] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:33,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279109668] [2025-04-29 11:22:33,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:33,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:33,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:34,001 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:34,002 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:34,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:22:34,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:22:34,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:34,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:22:34,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279109668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:34,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:34,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:22:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805030821] [2025-04-29 11:22:34,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:34,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:34,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:34,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:34,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:34,099 INFO L87 Difference]: Start difference. First operand 377 states and 476 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:34,114 INFO L93 Difference]: Finished difference Result 375 states and 470 transitions. [2025-04-29 11:22:34,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:34,114 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-04-29 11:22:34,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:34,115 INFO L225 Difference]: With dead ends: 375 [2025-04-29 11:22:34,116 INFO L226 Difference]: Without dead ends: 375 [2025-04-29 11:22:34,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:34,116 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:34,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-04-29 11:22:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-04-29 11:22:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 337 states have (on average 1.3086053412462908) internal successors, (441), 358 states have internal predecessors, (441), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-29 11:22:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 470 transitions. [2025-04-29 11:22:34,123 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 470 transitions. Word has length 40 [2025-04-29 11:22:34,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:34,123 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 470 transitions. [2025-04-29 11:22:34,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:34,123 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 470 transitions. [2025-04-29 11:22:34,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:22:34,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:34,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:34,130 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:34,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:22:34,328 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:34,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2015295062, now seen corresponding path program 1 times [2025-04-29 11:22:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:34,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125068123] [2025-04-29 11:22:34,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:34,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:22:34,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:22:34,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:34,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:34,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125068123] [2025-04-29 11:22:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125068123] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:34,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727903231] [2025-04-29 11:22:34,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:34,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:34,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:34,371 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:34,373 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:34,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:22:34,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:22:34,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:34,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:22:34,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727903231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:34,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:34,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:22:34,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730259530] [2025-04-29 11:22:34,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:34,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:34,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:34,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:34,498 INFO L87 Difference]: Start difference. First operand 375 states and 470 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:34,528 INFO L93 Difference]: Finished difference Result 373 states and 464 transitions. [2025-04-29 11:22:34,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:34,528 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-04-29 11:22:34,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:34,529 INFO L225 Difference]: With dead ends: 373 [2025-04-29 11:22:34,530 INFO L226 Difference]: Without dead ends: 373 [2025-04-29 11:22:34,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:34,530 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:34,530 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 75 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-29 11:22:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-04-29 11:22:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 337 states have (on average 1.2908011869436202) internal successors, (435), 356 states have internal predecessors, (435), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-29 11:22:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 464 transitions. [2025-04-29 11:22:34,536 INFO L79 Accepts]: Start accepts. Automaton has 373 states and 464 transitions. Word has length 41 [2025-04-29 11:22:34,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:34,537 INFO L485 AbstractCegarLoop]: Abstraction has 373 states and 464 transitions. [2025-04-29 11:22:34,537 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:34,537 INFO L278 IsEmpty]: Start isEmpty. Operand 373 states and 464 transitions. [2025-04-29 11:22:34,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:22:34,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:34,537 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:34,544 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:34,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:34,738 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:34,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1950362614, now seen corresponding path program 1 times [2025-04-29 11:22:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:34,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100248774] [2025-04-29 11:22:34,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:34,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:34,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:22:34,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:22:34,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:34,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:34,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100248774] [2025-04-29 11:22:34,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100248774] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:34,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867673457] [2025-04-29 11:22:34,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:34,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:34,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:34,821 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:34,822 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:34,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:22:34,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:22:34,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:34,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:34,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:34,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:22:34,908 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:22:34,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:22:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867673457] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:34,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:34,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:22:34,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929604017] [2025-04-29 11:22:34,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:34,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:34,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:34,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:34,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:34,960 INFO L87 Difference]: Start difference. First operand 373 states and 464 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:35,014 INFO L93 Difference]: Finished difference Result 401 states and 491 transitions. [2025-04-29 11:22:35,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:35,014 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-04-29 11:22:35,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:35,015 INFO L225 Difference]: With dead ends: 401 [2025-04-29 11:22:35,015 INFO L226 Difference]: Without dead ends: 401 [2025-04-29 11:22:35,016 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:35,016 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 31 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:35,016 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 131 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-04-29 11:22:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 373. [2025-04-29 11:22:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 337 states have (on average 1.28486646884273) internal successors, (433), 356 states have internal predecessors, (433), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-29 11:22:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 462 transitions. [2025-04-29 11:22:35,024 INFO L79 Accepts]: Start accepts. Automaton has 373 states and 462 transitions. Word has length 42 [2025-04-29 11:22:35,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:35,024 INFO L485 AbstractCegarLoop]: Abstraction has 373 states and 462 transitions. [2025-04-29 11:22:35,024 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:35,025 INFO L278 IsEmpty]: Start isEmpty. Operand 373 states and 462 transitions. [2025-04-29 11:22:35,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:22:35,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:35,025 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:35,031 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:35,228 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:35,228 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:35,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -709967401, now seen corresponding path program 1 times [2025-04-29 11:22:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:35,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342289697] [2025-04-29 11:22:35,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:35,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:22:35,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:22:35,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:35,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:35,270 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:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:35,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342289697] [2025-04-29 11:22:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342289697] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:35,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661510371] [2025-04-29 11:22:35,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:35,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:35,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:35,273 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:35,274 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:35,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:22:35,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:22:35,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:35,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:35,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:22:35,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:35,351 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:35,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661510371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:35,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:22:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-04-29 11:22:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245084323] [2025-04-29 11:22:35,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:35,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:35,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:35,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:35,352 INFO L87 Difference]: Start difference. First operand 373 states and 462 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:35,369 INFO L93 Difference]: Finished difference Result 366 states and 441 transitions. [2025-04-29 11:22:35,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:35,369 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:35,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:35,371 INFO L225 Difference]: With dead ends: 366 [2025-04-29 11:22:35,371 INFO L226 Difference]: Without dead ends: 366 [2025-04-29 11:22:35,371 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:35,371 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:35,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 170 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-04-29 11:22:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2025-04-29 11:22:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 328 states have (on average 1.2560975609756098) internal successors, (412), 347 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-29 11:22:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 441 transitions. [2025-04-29 11:22:35,379 INFO L79 Accepts]: Start accepts. Automaton has 364 states and 441 transitions. Word has length 45 [2025-04-29 11:22:35,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:35,379 INFO L485 AbstractCegarLoop]: Abstraction has 364 states and 441 transitions. [2025-04-29 11:22:35,379 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:35,379 INFO L278 IsEmpty]: Start isEmpty. Operand 364 states and 441 transitions. [2025-04-29 11:22:35,379 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:22:35,379 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:35,380 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:35,386 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:35,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 11:22:35,580 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:35,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1420213817, now seen corresponding path program 1 times [2025-04-29 11:22:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:35,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457796877] [2025-04-29 11:22:35,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:35,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:22:35,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:22:35,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:35,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-29 11:22:35,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:35,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457796877] [2025-04-29 11:22:35,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457796877] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:35,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:35,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:35,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999068895] [2025-04-29 11:22:35,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:35,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:35,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:35,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:35,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:35,605 INFO L87 Difference]: Start difference. First operand 364 states and 441 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:35,609 INFO L93 Difference]: Finished difference Result 299 states and 349 transitions. [2025-04-29 11:22:35,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:35,610 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-04-29 11:22:35,610 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:35,611 INFO L225 Difference]: With dead ends: 299 [2025-04-29 11:22:35,611 INFO L226 Difference]: Without dead ends: 299 [2025-04-29 11:22:35,611 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:35,612 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:35,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-04-29 11:22:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2025-04-29 11:22:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 270 states have (on average 1.2074074074074075) internal successors, (326), 281 states have internal predecessors, (326), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-29 11:22:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2025-04-29 11:22:35,617 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 47 [2025-04-29 11:22:35,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:35,617 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2025-04-29 11:22:35,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:35,617 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2025-04-29 11:22:35,618 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:22:35,618 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:35,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:35,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:22:35,618 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:35,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1750915867, now seen corresponding path program 1 times [2025-04-29 11:22:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:35,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322284946] [2025-04-29 11:22:35,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:35,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:35,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:35,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:35,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:35,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:35,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322284946] [2025-04-29 11:22:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322284946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:35,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350212194] [2025-04-29 11:22:35,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:35,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:35,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:35,678 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:35,680 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:35,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:35,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:35,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:35,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:22:35,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:35,777 WARN L871 $PredicateComparison]: unable to prove that (exists ((|v_parse_input_c1_~x~0#1.base_62| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_parse_input_c1_~x~0#1.base_62| (select |c_#valid| |v_parse_input_c1_~x~0#1.base_62|))) (<= |v_parse_input_c1_~x~0#1.base_62| c_~global~0.base))) is different from true [2025-04-29 11:22:35,798 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:35,799 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:35,917 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:35,917 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:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-04-29 11:22:35,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350212194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:36,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 16 [2025-04-29 11:22:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617016896] [2025-04-29 11:22:36,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:36,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:22:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:36,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:22:36,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=259, Unknown=2, NotChecked=32, Total=342 [2025-04-29 11:22:36,030 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:36,498 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2025-04-29 11:22:36,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:22:36,498 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2025-04-29 11:22:36,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:36,499 INFO L225 Difference]: With dead ends: 274 [2025-04-29 11:22:36,499 INFO L226 Difference]: Without dead ends: 274 [2025-04-29 11:22:36,500 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1052, Unknown=2, NotChecked=70, Total=1406 [2025-04-29 11:22:36,500 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 341 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:36,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 394 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 405 Invalid, 0 Unknown, 168 Unchecked, 0.2s Time] [2025-04-29 11:22:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-29 11:22:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 257. [2025-04-29 11:22:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 235 states have (on average 1.1787234042553192) internal successors, (277), 244 states have internal predecessors, (277), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:22:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 292 transitions. [2025-04-29 11:22:36,505 INFO L79 Accepts]: Start accepts. Automaton has 257 states and 292 transitions. Word has length 51 [2025-04-29 11:22:36,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:36,505 INFO L485 AbstractCegarLoop]: Abstraction has 257 states and 292 transitions. [2025-04-29 11:22:36,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:36,505 INFO L278 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2025-04-29 11:22:36,505 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:22:36,505 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:36,505 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:36,511 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:22:36,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:36,706 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:36,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:36,706 INFO L85 PathProgramCache]: Analyzing trace with hash 827255584, now seen corresponding path program 1 times [2025-04-29 11:22:36,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:36,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259576807] [2025-04-29 11:22:36,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:36,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:36,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:36,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:36,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:36,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259576807] [2025-04-29 11:22:36,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259576807] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:36,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349577711] [2025-04-29 11:22:36,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:36,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:36,850 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:36,852 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:36,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:36,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:36,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:36,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:36,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:22:36,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:36,995 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:36,995 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:37,097 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:37,098 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:37,124 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:37,125 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:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:37,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:37,196 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:22:37,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2025-04-29 11:22:37,334 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:22:37,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2025-04-29 11:22:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:37,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349577711] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:37,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:37,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2025-04-29 11:22:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283946586] [2025-04-29 11:22:37,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:37,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:22:37,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:37,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:22:37,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:22:37,448 INFO L87 Difference]: Start difference. First operand 257 states and 292 transitions. Second operand has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 11:22:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:37,568 INFO L93 Difference]: Finished difference Result 265 states and 300 transitions. [2025-04-29 11:22:37,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:22:37,569 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2025-04-29 11:22:37,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:37,570 INFO L225 Difference]: With dead ends: 265 [2025-04-29 11:22:37,570 INFO L226 Difference]: Without dead ends: 265 [2025-04-29 11:22:37,570 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:22:37,571 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 145 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:37,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 142 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-29 11:22:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 256. [2025-04-29 11:22:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.174468085106383) internal successors, (276), 243 states have internal predecessors, (276), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:22:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 291 transitions. [2025-04-29 11:22:37,575 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 291 transitions. Word has length 51 [2025-04-29 11:22:37,575 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:37,575 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 291 transitions. [2025-04-29 11:22:37,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 11:22:37,575 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 291 transitions. [2025-04-29 11:22:37,576 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:22:37,576 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:37,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:37,582 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:37,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:37,780 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:37,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -124880695, now seen corresponding path program 1 times [2025-04-29 11:22:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:37,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584648307] [2025-04-29 11:22:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:37,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:37,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:37,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:37,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:38,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584648307] [2025-04-29 11:22:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584648307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:38,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157234019] [2025-04-29 11:22:38,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:38,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:38,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:38,251 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:38,252 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:38,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:38,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:38,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:38,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:38,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:22:38,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:38,445 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:38,445 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:38,602 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:38,602 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:38,634 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:38,634 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:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:38,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:38,784 INFO L325 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-04-29 11:22:38,785 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 81 [2025-04-29 11:22:38,953 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-29 11:22:38,953 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2025-04-29 11:22:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157234019] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:39,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 14] total 42 [2025-04-29 11:22:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141549764] [2025-04-29 11:22:39,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:39,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 11:22:39,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:39,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 11:22:39,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1611, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:22:39,198 INFO L87 Difference]: Start difference. First operand 256 states and 291 transitions. Second operand has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:22:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:39,594 INFO L93 Difference]: Finished difference Result 266 states and 299 transitions. [2025-04-29 11:22:39,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:22:39,595 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2025-04-29 11:22:39,595 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:39,595 INFO L225 Difference]: With dead ends: 266 [2025-04-29 11:22:39,595 INFO L226 Difference]: Without dead ends: 266 [2025-04-29 11:22:39,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=433, Invalid=2219, Unknown=0, NotChecked=0, Total=2652 [2025-04-29 11:22:39,596 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 339 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:39,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 277 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-29 11:22:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2025-04-29 11:22:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.1702127659574468) internal successors, (275), 243 states have internal predecessors, (275), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:22:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 290 transitions. [2025-04-29 11:22:39,600 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 290 transitions. Word has length 52 [2025-04-29 11:22:39,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:39,600 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 290 transitions. [2025-04-29 11:22:39,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:22:39,600 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 290 transitions. [2025-04-29 11:22:39,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:22:39,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:39,601 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:39,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:39,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-29 11:22:39,802 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:39,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2017261651, now seen corresponding path program 1 times [2025-04-29 11:22:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:39,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740737733] [2025-04-29 11:22:39,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:39,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:39,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:39,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:39,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:22:39,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:39,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740737733] [2025-04-29 11:22:39,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740737733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:39,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427770575] [2025-04-29 11:22:39,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:39,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:39,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:39,935 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:39,937 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:39,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:39,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:39,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:39,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:40,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:22:40,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:40,051 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:40,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:40,073 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:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2025-04-29 11:22:40,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:40,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427770575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:40,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:40,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2025-04-29 11:22:40,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331489781] [2025-04-29 11:22:40,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:40,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:22:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:40,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:22:40,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=337, Unknown=1, NotChecked=38, Total=462 [2025-04-29 11:22:40,307 INFO L87 Difference]: Start difference. First operand 256 states and 290 transitions. Second operand has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:40,584 INFO L93 Difference]: Finished difference Result 267 states and 295 transitions. [2025-04-29 11:22:40,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:22:40,585 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2025-04-29 11:22:40,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:40,586 INFO L225 Difference]: With dead ends: 267 [2025-04-29 11:22:40,586 INFO L226 Difference]: Without dead ends: 267 [2025-04-29 11:22:40,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=918, Unknown=1, NotChecked=68, Total=1332 [2025-04-29 11:22:40,586 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 312 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:40,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 179 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 191 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2025-04-29 11:22:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-04-29 11:22:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 255. [2025-04-29 11:22:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 242 states have internal predecessors, (269), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:22:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 284 transitions. [2025-04-29 11:22:40,590 INFO L79 Accepts]: Start accepts. Automaton has 255 states and 284 transitions. Word has length 52 [2025-04-29 11:22:40,590 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:40,590 INFO L485 AbstractCegarLoop]: Abstraction has 255 states and 284 transitions. [2025-04-29 11:22:40,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:40,590 INFO L278 IsEmpty]: Start isEmpty. Operand 255 states and 284 transitions. [2025-04-29 11:22:40,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:22:40,591 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:40,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:40,597 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:22:40,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-29 11:22:40,791 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:40,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash 248737707, now seen corresponding path program 1 times [2025-04-29 11:22:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:40,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615332428] [2025-04-29 11:22:40,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:40,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:22:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:22:40,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:40,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:41,019 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:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:41,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615332428] [2025-04-29 11:22:41,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615332428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:41,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127173600] [2025-04-29 11:22:41,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:41,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:41,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:41,022 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:22:41,023 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:22:41,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:22:41,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:22:41,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:41,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:41,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:22:41,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:41,153 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:41,154 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:41,319 INFO L325 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2025-04-29 11:22:41,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2025-04-29 11:22:41,390 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-29 11:22:41,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2025-04-29 11:22:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:41,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:41,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127173600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:41,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:41,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-04-29 11:22:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379690181] [2025-04-29 11:22:41,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:41,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:22:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:41,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:22:41,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:41,472 INFO L87 Difference]: Start difference. First operand 255 states and 284 transitions. Second operand has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:22:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:41,832 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2025-04-29 11:22:41,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:22:41,833 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2025-04-29 11:22:41,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:41,834 INFO L225 Difference]: With dead ends: 263 [2025-04-29 11:22:41,834 INFO L226 Difference]: Without dead ends: 263 [2025-04-29 11:22:41,834 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:22:41,834 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 302 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:41,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 215 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 297 Invalid, 1 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-04-29 11:22:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2025-04-29 11:22:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 235 states have (on average 1.1404255319148937) internal successors, (268), 241 states have internal predecessors, (268), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:22:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2025-04-29 11:22:41,838 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 54 [2025-04-29 11:22:41,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:41,838 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2025-04-29 11:22:41,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:22:41,838 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2025-04-29 11:22:41,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-04-29 11:22:41,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:41,839 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:41,845 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:22:42,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:22:42,039 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:42,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash -520337758, now seen corresponding path program 1 times [2025-04-29 11:22:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:42,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483357238] [2025-04-29 11:22:42,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:42,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:22:42,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:22:42,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:42,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:42,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:42,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483357238] [2025-04-29 11:22:42,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483357238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:42,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957067845] [2025-04-29 11:22:42,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:42,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:42,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:42,388 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:22:42,390 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:22:42,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:22:42,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:22:42,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:42,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:42,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-29 11:22:42,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:42,657 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:42,658 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:43,049 INFO L325 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-04-29 11:22:43,050 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 67 [2025-04-29 11:22:43,095 INFO L325 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-04-29 11:22:43,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 14 [2025-04-29 11:22:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:43,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:43,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957067845] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:43,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:43,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 30 [2025-04-29 11:22:43,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864122343] [2025-04-29 11:22:43,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-29 11:22:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:43,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-29 11:22:43,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:22:43,802 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 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:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:44,928 INFO L93 Difference]: Finished difference Result 265 states and 293 transitions. [2025-04-29 11:22:44,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:22:44,928 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 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 60 [2025-04-29 11:22:44,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:44,929 INFO L225 Difference]: With dead ends: 265 [2025-04-29 11:22:44,929 INFO L226 Difference]: Without dead ends: 265 [2025-04-29 11:22:44,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=591, Invalid=2831, Unknown=0, NotChecked=0, Total=3422 [2025-04-29 11:22:44,930 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 324 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:44,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 427 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 777 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:22:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-29 11:22:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 253. [2025-04-29 11:22:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 235 states have (on average 1.1361702127659574) internal successors, (267), 240 states have internal predecessors, (267), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:22:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 282 transitions. [2025-04-29 11:22:44,934 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 282 transitions. Word has length 60 [2025-04-29 11:22:44,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:44,934 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 282 transitions. [2025-04-29 11:22:44,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 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:44,934 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 282 transitions. [2025-04-29 11:22:44,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-04-29 11:22:44,935 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:44,935 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:44,941 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:22:45,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:45,136 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:45,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1049398727, now seen corresponding path program 1 times [2025-04-29 11:22:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:45,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702598308] [2025-04-29 11:22:45,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:45,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-29 11:22:45,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:22:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:45,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702598308] [2025-04-29 11:22:45,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702598308] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:45,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161114061] [2025-04-29 11:22:45,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:45,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:45,505 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:45,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-29 11:22:45,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-29 11:22:45,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:22:45,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:45,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:45,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-29 11:22:45,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:45,798 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:45,799 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:45,801 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:45,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:45,956 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,089 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:22:46,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:46,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161114061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:46,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:46,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 23 [2025-04-29 11:22:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307653253] [2025-04-29 11:22:46,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:46,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:22:46,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:46,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:22:46,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:22:46,261 INFO L87 Difference]: Start difference. First operand 253 states and 282 transitions. Second operand has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:22:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:46,945 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2025-04-29 11:22:46,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:22:46,946 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2025-04-29 11:22:46,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:46,947 INFO L225 Difference]: With dead ends: 278 [2025-04-29 11:22:46,947 INFO L226 Difference]: Without dead ends: 278 [2025-04-29 11:22:46,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2025-04-29 11:22:46,948 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 312 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:46,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 213 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-29 11:22:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 252. [2025-04-29 11:22:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 235 states have (on average 1.1319148936170214) internal successors, (266), 239 states have internal predecessors, (266), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:22:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2025-04-29 11:22:46,951 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 61 [2025-04-29 11:22:46,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:46,951 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2025-04-29 11:22:46,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:22:46,951 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2025-04-29 11:22:46,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:22:46,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:46,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:46,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:47,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:22:47,156 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:47,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1213223649, now seen corresponding path program 1 times [2025-04-29 11:22:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:47,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658442256] [2025-04-29 11:22:47,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:47,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:22:47,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:22:47,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:47,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:47,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:47,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658442256] [2025-04-29 11:22:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658442256] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:47,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086025141] [2025-04-29 11:22:47,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:47,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:47,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:47,296 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:47,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-29 11:22:47,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:22:47,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:22:47,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:47,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:47,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:22:47,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:47,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:22:47,459 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:47,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2025-04-29 11:22:47,482 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:22:47,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:22:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:47,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:47,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086025141] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:47,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-04-29 11:22:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347408873] [2025-04-29 11:22:47,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:47,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:22:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:47,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:22:47,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:47,544 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:22:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:47,665 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2025-04-29 11:22:47,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:22:47,666 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-04-29 11:22:47,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:47,666 INFO L225 Difference]: With dead ends: 263 [2025-04-29 11:22:47,666 INFO L226 Difference]: Without dead ends: 263 [2025-04-29 11:22:47,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:22:47,667 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 20 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:47,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 252 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:47,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-04-29 11:22:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 207. [2025-04-29 11:22:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-29 11:22:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 231 transitions. [2025-04-29 11:22:47,670 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 231 transitions. Word has length 66 [2025-04-29 11:22:47,670 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:47,671 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 231 transitions. [2025-04-29 11:22:47,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:22:47,671 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2025-04-29 11:22:47,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-29 11:22:47,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:47,671 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:47,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:47,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:47,875 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:47,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1024292242, now seen corresponding path program 1 times [2025-04-29 11:22:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:47,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735404344] [2025-04-29 11:22:47,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:47,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:22:47,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:22:47,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:47,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:22:47,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:22:47,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:22:47,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:22:47,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:47,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:22:47,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:22:47,918 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:22:47,919 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-04-29 11:22:47,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-04-29 11:22:47,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-04-29 11:22:47,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-04-29 11:22:47,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-04-29 11:22:47,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2025-04-29 11:22:47,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2025-04-29 11:22:47,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2025-04-29 11:22:47,920 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2025-04-29 11:22:47,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2025-04-29 11:22:47,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:22:47,923 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:47,999 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:22:48,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:22:48 BoogieIcfgContainer [2025-04-29 11:22:48,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:22:48,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:22:48,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:22:48,002 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:22:48,003 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:23" (3/4) ... [2025-04-29 11:22:48,005 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:22:48,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:22:48,006 INFO L158 Benchmark]: Toolchain (without parser) took 25163.84ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 123.5MB in the beginning and 319.4MB in the end (delta: -195.9MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-04-29 11:22:48,006 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:22:48,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.63ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 108.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:22:48,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.75ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:22:48,006 INFO L158 Benchmark]: Boogie Preprocessor took 39.25ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 105.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:22:48,007 INFO L158 Benchmark]: RCFGBuilder took 300.52ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 88.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:22:48,007 INFO L158 Benchmark]: TraceAbstraction took 24599.14ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 87.5MB in the beginning and 319.5MB in the end (delta: -231.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2025-04-29 11:22:48,007 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 402.7MB. Free memory was 319.5MB in the beginning and 319.4MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:22:48,007 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.91ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.63ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 108.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.75ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.25ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 105.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 300.52ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 88.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24599.14ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 87.5MB in the beginning and 319.5MB in the end (delta: -231.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 402.7MB. Free memory was 319.5MB in the beginning and 319.4MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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={7: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={7:0}] [L56] global = x [L57] state = STATE_2 VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={7:0}, state=1] [L39] RET commands[i].function() [L72] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L73] CALL parse_input("c1") 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)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4: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)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] COND FALSE !(strcmp(commands[i].name,input) == 0) [L36] i++ VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [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)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] COND FALSE !(strcmp(commands[i].name,input) == 0) [L36] i++ VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=2, input={4:0}, state=1] [L36] COND FALSE !(i < 2) [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 FALSE !(strcmp(commands[i].name,input) == 0) [L36] i++ VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [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=1, 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=1, 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=1, 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=1, 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=1, input={5:0}, state=1] [L37] COND FALSE !(strcmp(commands[i].name,input) == 0) [L36] i++ VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=2, input={5:0}, state=1] [L36] COND FALSE !(i < 2) [L74] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L75] return 0; VAL [\result=0, commands={6:0}, global={7:0}, state=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: 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. - UnprovableResult [Line: 54]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 54]: 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: 31, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 5533 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5533 mSDsluCounter, 6899 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 596 IncrementalHoareTripleChecker+Unchecked, 5386 mSDsCounter, 625 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6167 IncrementalHoareTripleChecker+Invalid, 7390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 625 mSolverCounterUnsat, 1513 mSDtfsCounter, 6167 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1624 GetRequests, 1083 SyntacticMatches, 8 SemanticMatches, 533 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=16, InterpolantAutomatonStates: 295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 625 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 1883 NumberOfCodeBlocks, 1883 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2028 ConstructedInterpolants, 132 QuantifiedInterpolants, 23177 SizeOfPredicates, 82 NumberOfNonLiveVariables, 5374 ConjunctsInSsa, 423 ConjunctsInUnsatCore, 59 InterpolantComputations, 11 PerfectInterpolantSequences, 400/1020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:22:48,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.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 705ad2bbbe3c7f3c6f5cd876d831ecd184de0c7834e69dbbbb193e9c96714a26 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:49,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:49,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-29 11:22:49,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:49,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:49,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:49,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:49,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:49,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:49,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:49,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:49,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:49,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:49,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:49,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:49,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:49,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:49,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:49,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:49,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:49,968 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 -> 705ad2bbbe3c7f3c6f5cd876d831ecd184de0c7834e69dbbbb193e9c96714a26 [2025-04-29 11:22:50,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:50,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:50,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:50,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:50,211 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:50,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.c [2025-04-29 11:22:51,541 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f12c5eb/1f93af06fbf24e5b8644d1ae487af363/FLAGd36b90d5a [2025-04-29 11:22:51,716 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:51,716 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-bftpd/bftpd_2.c [2025-04-29 11:22:51,718 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:51,718 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:51,723 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f12c5eb/1f93af06fbf24e5b8644d1ae487af363/FLAGd36b90d5a [2025-04-29 11:22:52,541 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f12c5eb/1f93af06fbf24e5b8644d1ae487af363 [2025-04-29 11:22:52,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:52,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:52,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:52,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:52,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:52,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6a60bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52, skipping insertion in model container [2025-04-29 11:22:52,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:52,692 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:52,698 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:52,720 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:52,753 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:52,770 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:52,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52 WrapperNode [2025-04-29 11:22:52,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:52,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:52,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:52,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:52,776 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:52" (1/1) ... [2025-04-29 11:22:52,785 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:52" (1/1) ... [2025-04-29 11:22:52,805 INFO L138 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-04-29 11:22:52,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:52,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:52,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:52,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:52,813 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:52" (1/1) ... [2025-04-29 11:22:52,813 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:52" (1/1) ... [2025-04-29 11:22:52,816 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:52" (1/1) ... [2025-04-29 11:22:52,839 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:52,840 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:52" (1/1) ... [2025-04-29 11:22:52,840 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:52" (1/1) ... [2025-04-29 11:22:52,848 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:52" (1/1) ... [2025-04-29 11:22:52,850 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:52" (1/1) ... [2025-04-29 11:22:52,852 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:52" (1/1) ... [2025-04-29 11:22:52,858 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:52" (1/1) ... [2025-04-29 11:22:52,859 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:52" (1/1) ... [2025-04-29 11:22:52,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:52,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:52,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:52,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:52,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (1/1) ... [2025-04-29 11:22:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:52,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:52,890 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:52,893 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:52,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:22:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:22:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:22:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:22:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:22:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:22:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:22:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-04-29 11:22:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-04-29 11:22:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-04-29 11:22:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-29 11:22:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-04-29 11:22:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-04-29 11:22:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-04-29 11:22:52,916 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-04-29 11:22:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:22:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:22:52,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:22:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:22:53,005 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:22:53,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:22:53,264 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-29 11:22:53,264 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:22:53,271 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:22:53,273 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:22:53,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:53 BoogieIcfgContainer [2025-04-29 11:22:53,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:22:53,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:22:53,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:22:53,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:22:53,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:52" (1/3) ... [2025-04-29 11:22:53,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b64489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:53, skipping insertion in model container [2025-04-29 11:22:53,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:52" (2/3) ... [2025-04-29 11:22:53,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b64489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:53, skipping insertion in model container [2025-04-29 11:22:53,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:53" (3/3) ... [2025-04-29 11:22:53,283 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.c [2025-04-29 11:22:53,293 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:22:53,295 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.c that has 2 procedures, 61 locations, 72 edges, 1 initial locations, 1 loop locations, and 20 error locations. [2025-04-29 11:22:53,327 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:22:53,335 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;@c6c4734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:22:53,335 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-29 11:22:53,338 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:53,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:53,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,342 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:53,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash -920361850, now seen corresponding path program 1 times [2025-04-29 11:22:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:53,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705291764] [2025-04-29 11:22:53,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:53,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:53,354 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:53,356 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:53,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:53,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:53,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:22:53,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:53,538 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:53,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:53,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:53,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705291764] [2025-04-29 11:22:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705291764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968683607] [2025-04-29 11:22:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:53,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:53,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:53,559 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:22:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,665 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2025-04-29 11:22:53,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:53,667 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:22:53,667 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,673 INFO L225 Difference]: With dead ends: 110 [2025-04-29 11:22:53,675 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:22:53,676 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:22:53,678 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,679 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 101 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:22:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2025-04-29 11:22:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 76 states have internal predecessors, (97), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-29 11:22:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2025-04-29 11:22:53,717 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 6 [2025-04-29 11:22:53,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,717 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2025-04-29 11:22:53,718 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:22:53,718 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2025-04-29 11:22:53,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:53,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:53,919 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:22:53,920 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:53,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash -920361849, now seen corresponding path program 1 times [2025-04-29 11:22:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:53,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63536412] [2025-04-29 11:22:53,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:53,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:53,923 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:53,924 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:53,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:53,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:53,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:22:53,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:54,066 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:54,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:54,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:54,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63536412] [2025-04-29 11:22:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63536412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623468299] [2025-04-29 11:22:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:54,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:54,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:54,071 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,202 INFO L93 Difference]: Finished difference Result 180 states and 242 transitions. [2025-04-29 11:22:54,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:54,202 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:54,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,203 INFO L225 Difference]: With dead ends: 180 [2025-04-29 11:22:54,203 INFO L226 Difference]: Without dead ends: 180 [2025-04-29 11:22:54,203 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:22:54,204 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 86 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,204 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 139 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-04-29 11:22:54,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2025-04-29 11:22:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.7394957983193278) internal successors, (207), 138 states have internal predecessors, (207), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 238 transitions. [2025-04-29 11:22:54,219 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 238 transitions. Word has length 6 [2025-04-29 11:22:54,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,219 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 238 transitions. [2025-04-29 11:22:54,219 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:54,220 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 238 transitions. [2025-04-29 11:22:54,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:22:54,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,225 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:54,420 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:22:54,421 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:54,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1533553699, now seen corresponding path program 1 times [2025-04-29 11:22:54,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:54,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563114241] [2025-04-29 11:22:54,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:54,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:54,424 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:54,424 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:54,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:22:54,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:22:54,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:22:54,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:54,573 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:54,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:54,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:54,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563114241] [2025-04-29 11:22:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563114241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:54,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720912961] [2025-04-29 11:22:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:54,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:54,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:54,575 INFO L87 Difference]: Start difference. First operand 152 states and 238 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,760 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-04-29 11:22:54,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:54,760 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:54,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,762 INFO L225 Difference]: With dead ends: 192 [2025-04-29 11:22:54,762 INFO L226 Difference]: Without dead ends: 192 [2025-04-29 11:22:54,762 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:22:54,763 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 159 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-29 11:22:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2025-04-29 11:22:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.721311475409836) internal successors, (210), 141 states have internal predecessors, (210), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2025-04-29 11:22:54,774 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 7 [2025-04-29 11:22:54,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,774 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2025-04-29 11:22:54,774 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:54,774 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2025-04-29 11:22:54,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:22:54,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,781 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:54,978 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:22:54,978 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:54,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 295524454, now seen corresponding path program 1 times [2025-04-29 11:22:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:54,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317028552] [2025-04-29 11:22:54,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:54,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:54,982 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:54,983 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:55,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:22:55,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:22:55,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:22:55,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:55,152 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:55,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:55,152 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:55,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317028552] [2025-04-29 11:22:55,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317028552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:55,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:55,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:55,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344111813] [2025-04-29 11:22:55,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:55,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:55,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:55,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:55,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:55,154 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:55,320 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2025-04-29 11:22:55,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:55,321 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:55,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:55,322 INFO L225 Difference]: With dead ends: 182 [2025-04-29 11:22:55,322 INFO L226 Difference]: Without dead ends: 182 [2025-04-29 11:22:55,323 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:22:55,323 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 68 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:55,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 205 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-29 11:22:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 155. [2025-04-29 11:22:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.7049180327868851) internal successors, (208), 141 states have internal predecessors, (208), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2025-04-29 11:22:55,347 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 8 [2025-04-29 11:22:55,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:55,347 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2025-04-29 11:22:55,347 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:55,347 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2025-04-29 11:22:55,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:55,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:55,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:55,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:55,548 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:22:55,548 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:55,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash 571323525, now seen corresponding path program 1 times [2025-04-29 11:22:55,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:55,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825570949] [2025-04-29 11:22:55,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:55,552 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:55,552 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:55,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:55,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:55,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:22:55,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:55,651 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:55,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:55,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:55,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825570949] [2025-04-29 11:22:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825570949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:55,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:55,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:55,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926114075] [2025-04-29 11:22:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:55,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:55,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:55,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:55,653 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:55,776 INFO L93 Difference]: Finished difference Result 234 states and 321 transitions. [2025-04-29 11:22:55,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:55,777 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:55,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:55,778 INFO L225 Difference]: With dead ends: 234 [2025-04-29 11:22:55,778 INFO L226 Difference]: Without dead ends: 234 [2025-04-29 11:22:55,779 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:22:55,779 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 172 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:55,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 170 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-29 11:22:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 191. [2025-04-29 11:22:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.6538461538461537) internal successors, (258), 176 states have internal predecessors, (258), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 289 transitions. [2025-04-29 11:22:55,792 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 289 transitions. Word has length 9 [2025-04-29 11:22:55,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:55,792 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 289 transitions. [2025-04-29 11:22:55,792 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:55,792 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 289 transitions. [2025-04-29 11:22:55,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:22:55,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:55,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:55,798 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:22:55,993 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:22:55,993 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:55,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash 531160136, now seen corresponding path program 1 times [2025-04-29 11:22:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:55,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038503664] [2025-04-29 11:22:55,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:55,995 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:55,996 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:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:22:56,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:22:56,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:22:56,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:56,121 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:56,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:56,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:56,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038503664] [2025-04-29 11:22:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038503664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:56,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:56,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256051925] [2025-04-29 11:22:56,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:56,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:56,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:56,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:56,123 INFO L87 Difference]: Start difference. First operand 191 states and 289 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:56,260 INFO L93 Difference]: Finished difference Result 231 states and 304 transitions. [2025-04-29 11:22:56,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:56,261 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:56,261 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:56,262 INFO L225 Difference]: With dead ends: 231 [2025-04-29 11:22:56,262 INFO L226 Difference]: Without dead ends: 231 [2025-04-29 11:22:56,262 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:22:56,263 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:56,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 204 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-04-29 11:22:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 201. [2025-04-29 11:22:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.6424242424242423) internal successors, (271), 186 states have internal predecessors, (271), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2025-04-29 11:22:56,271 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 10 [2025-04-29 11:22:56,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:56,272 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2025-04-29 11:22:56,272 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:56,272 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2025-04-29 11:22:56,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:22:56,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:56,272 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:56,278 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:56,472 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:22:56,473 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:56,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 738472334, now seen corresponding path program 1 times [2025-04-29 11:22:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:56,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646137581] [2025-04-29 11:22:56,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:56,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:56,476 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:56,477 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:56,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:56,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:56,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:22:56,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:56,660 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:56,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:56,848 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:56,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:56,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646137581] [2025-04-29 11:22:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646137581] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:56,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:56,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-04-29 11:22:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863142279] [2025-04-29 11:22:56,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:56,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:56,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:56,850 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:57,147 INFO L93 Difference]: Finished difference Result 269 states and 359 transitions. [2025-04-29 11:22:57,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:57,148 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:22:57,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:57,149 INFO L225 Difference]: With dead ends: 269 [2025-04-29 11:22:57,149 INFO L226 Difference]: Without dead ends: 269 [2025-04-29 11:22:57,150 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:22:57,150 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 132 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:57,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 321 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:22:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-04-29 11:22:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-04-29 11:22:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 195 states have (on average 1.6358974358974359) internal successors, (319), 216 states have internal predecessors, (319), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 350 transitions. [2025-04-29 11:22:57,157 INFO L79 Accepts]: Start accepts. Automaton has 231 states and 350 transitions. Word has length 14 [2025-04-29 11:22:57,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:57,158 INFO L485 AbstractCegarLoop]: Abstraction has 231 states and 350 transitions. [2025-04-29 11:22:57,158 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:22:57,158 INFO L278 IsEmpty]: Start isEmpty. Operand 231 states and 350 transitions. [2025-04-29 11:22:57,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:22:57,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:57,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:57,164 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:57,359 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:22:57,359 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:57,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1417805820, now seen corresponding path program 1 times [2025-04-29 11:22:57,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:57,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844802083] [2025-04-29 11:22:57,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:57,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:57,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:57,362 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:57,362 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:57,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:22:57,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:22:57,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:57,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:57,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:57,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:57,628 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:57,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:57,862 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:57,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:57,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844802083] [2025-04-29 11:22:57,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844802083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:57,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-04-29 11:22:57,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883227310] [2025-04-29 11:22:57,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:57,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:22:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:57,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:22:57,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:57,863 INFO L87 Difference]: Start difference. First operand 231 states and 350 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,990 INFO L93 Difference]: Finished difference Result 353 states and 485 transitions. [2025-04-29 11:22:58,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:22:58,991 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:22:58,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,992 INFO L225 Difference]: With dead ends: 353 [2025-04-29 11:22:58,992 INFO L226 Difference]: Without dead ends: 353 [2025-04-29 11:22:58,993 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:22:58,993 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 324 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 315 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:22:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-04-29 11:22:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 269. [2025-04-29 11:22:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 233 states have (on average 1.6351931330472103) internal successors, (381), 254 states have internal predecessors, (381), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2025-04-29 11:22:59,000 INFO L79 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 15 [2025-04-29 11:22:59,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:59,001 INFO L485 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2025-04-29 11:22:59,001 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:22:59,001 INFO L278 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2025-04-29 11:22:59,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:59,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:59,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:59,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:22:59,206 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:22:59,206 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:59,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1002307501, now seen corresponding path program 1 times [2025-04-29 11:22:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:59,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016431455] [2025-04-29 11:22:59,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:59,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:59,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:59,208 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:59,209 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:59,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:59,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:59,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:59,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:59,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:59,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:59,510 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:59,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:59,779 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:59,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:59,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016431455] [2025-04-29 11:22:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016431455] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:59,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:59,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-04-29 11:22:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253023530] [2025-04-29 11:22:59,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:59,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:22:59,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:59,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:22:59,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:59,780 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:00,900 INFO L93 Difference]: Finished difference Result 492 states and 681 transitions. [2025-04-29 11:23:00,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:23:00,901 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:00,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:00,904 INFO L225 Difference]: With dead ends: 492 [2025-04-29 11:23:00,904 INFO L226 Difference]: Without dead ends: 492 [2025-04-29 11:23:00,904 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:00,904 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 369 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:00,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 341 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:23:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-04-29 11:23:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 371. [2025-04-29 11:23:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 352 states have internal predecessors, (552), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-29 11:23:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 594 transitions. [2025-04-29 11:23:00,920 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 594 transitions. Word has length 16 [2025-04-29 11:23:00,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:00,920 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 594 transitions. [2025-04-29 11:23:00,920 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:00,920 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 594 transitions. [2025-04-29 11:23:00,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:23:00,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:00,921 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:00,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:23:01,126 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:01,126 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:01,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920271, now seen corresponding path program 1 times [2025-04-29 11:23:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:01,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152456638] [2025-04-29 11:23:01,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:01,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:01,129 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:01,130 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:01,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:23:01,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:23:01,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:23:01,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:01,174 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:01,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:01,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:01,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152456638] [2025-04-29 11:23:01,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152456638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737864994] [2025-04-29 11:23:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:01,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:01,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:01,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:01,175 INFO L87 Difference]: Start difference. First operand 371 states and 594 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,183 INFO L93 Difference]: Finished difference Result 370 states and 590 transitions. [2025-04-29 11:23:01,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:01,184 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:01,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,185 INFO L225 Difference]: With dead ends: 370 [2025-04-29 11:23:01,185 INFO L226 Difference]: Without dead ends: 370 [2025-04-29 11:23:01,185 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:01,186 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:01,186 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:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-29 11:23:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-04-29 11:23:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 331 states have (on average 1.6555891238670695) internal successors, (548), 351 states have internal predecessors, (548), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-29 11:23:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 590 transitions. [2025-04-29 11:23:01,195 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 590 transitions. Word has length 18 [2025-04-29 11:23:01,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,195 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 590 transitions. [2025-04-29 11:23:01,195 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:01,195 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 590 transitions. [2025-04-29 11:23:01,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:23:01,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,195 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:01,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:23:01,400 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:01,400 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:01,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,400 INFO L85 PathProgramCache]: Analyzing trace with hash 132632823, now seen corresponding path program 1 times [2025-04-29 11:23:01,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:01,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084796167] [2025-04-29 11:23:01,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:01,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:01,402 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:01,403 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:01,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:23:01,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:23:01,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:23:01,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:01,480 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:01,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:01,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:01,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084796167] [2025-04-29 11:23:01,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084796167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:23:01,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390698350] [2025-04-29 11:23:01,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:01,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:01,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:01,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:01,481 INFO L87 Difference]: Start difference. First operand 370 states and 590 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,501 INFO L93 Difference]: Finished difference Result 512 states and 817 transitions. [2025-04-29 11:23:01,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:01,502 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:01,502 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,504 INFO L225 Difference]: With dead ends: 512 [2025-04-29 11:23:01,504 INFO L226 Difference]: Without dead ends: 512 [2025-04-29 11:23:01,504 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:01,504 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:01,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-04-29 11:23:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 497. [2025-04-29 11:23:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 449 states have (on average 1.6547884187082404) internal successors, (743), 471 states have internal predecessors, (743), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2025-04-29 11:23:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 815 transitions. [2025-04-29 11:23:01,521 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 815 transitions. Word has length 19 [2025-04-29 11:23:01,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,522 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 815 transitions. [2025-04-29 11:23:01,522 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:01,522 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 815 transitions. [2025-04-29 11:23:01,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:23:01,523 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,523 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:01,529 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:01,723 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:01,723 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:01,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash 131986327, now seen corresponding path program 1 times [2025-04-29 11:23:01,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:01,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720038796] [2025-04-29 11:23:01,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:01,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:01,726 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:01,727 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:01,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:23:01,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:23:01,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:23:01,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:01,776 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:01,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:01,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:01,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720038796] [2025-04-29 11:23:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720038796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452981106] [2025-04-29 11:23:01,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:01,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:01,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:01,777 INFO L87 Difference]: Start difference. First operand 497 states and 815 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,795 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2025-04-29 11:23:01,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:01,795 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:01,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,799 INFO L225 Difference]: With dead ends: 356 [2025-04-29 11:23:01,799 INFO L226 Difference]: Without dead ends: 356 [2025-04-29 11:23:01,799 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:01,799 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:01,800 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:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-29 11:23:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-04-29 11:23:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 320 states have (on average 1.58125) internal successors, (506), 335 states have internal predecessors, (506), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-04-29 11:23:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 554 transitions. [2025-04-29 11:23:01,811 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 554 transitions. Word has length 19 [2025-04-29 11:23:01,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,811 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 554 transitions. [2025-04-29 11:23:01,811 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:01,811 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 554 transitions. [2025-04-29 11:23:01,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:23:01,814 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:01,820 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:02,014 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:02,015 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:02,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash -183349689, now seen corresponding path program 1 times [2025-04-29 11:23:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:02,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802603516] [2025-04-29 11:23:02,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:02,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:02,017 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:02,018 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:02,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:23:02,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:23:02,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:23:02,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:02,090 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:02,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:02,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:02,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802603516] [2025-04-29 11:23:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802603516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:02,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:02,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19706365] [2025-04-29 11:23:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:02,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:02,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:02,092 INFO L87 Difference]: Start difference. First operand 356 states and 554 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,114 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2025-04-29 11:23:02,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:02,114 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:23:02,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,115 INFO L225 Difference]: With dead ends: 328 [2025-04-29 11:23:02,115 INFO L226 Difference]: Without dead ends: 326 [2025-04-29 11:23:02,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:02,116 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-04-29 11:23:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 315. [2025-04-29 11:23:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 297 states have internal predecessors, (434), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-29 11:23:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2025-04-29 11:23:02,123 INFO L79 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 20 [2025-04-29 11:23:02,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,123 INFO L485 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2025-04-29 11:23:02,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,123 INFO L278 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2025-04-29 11:23:02,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:23:02,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,125 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:23:02,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 11:23:02,325 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:02,325 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:02,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 447088533, now seen corresponding path program 2 times [2025-04-29 11:23:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:02,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1617534370] [2025-04-29 11:23:02,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:23:02,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:02,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:02,329 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:02,330 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:02,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-29 11:23:02,373 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:02,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:23:02,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:23:02,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:02,400 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:02,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:02,438 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:02,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:02,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617534370] [2025-04-29 11:23:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617534370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:02,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-29 11:23:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949519649] [2025-04-29 11:23:02,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:23:02,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:02,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:23:02,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:02,440 INFO L87 Difference]: Start difference. First operand 315 states and 470 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,521 INFO L93 Difference]: Finished difference Result 282 states and 393 transitions. [2025-04-29 11:23:02,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:02,522 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:02,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,523 INFO L225 Difference]: With dead ends: 282 [2025-04-29 11:23:02,523 INFO L226 Difference]: Without dead ends: 282 [2025-04-29 11:23:02,523 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:02,523 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 252 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-04-29 11:23:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2025-04-29 11:23:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 235 states have (on average 1.4638297872340424) internal successors, (344), 250 states have internal predecessors, (344), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-29 11:23:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 380 transitions. [2025-04-29 11:23:02,529 INFO L79 Accepts]: Start accepts. Automaton has 268 states and 380 transitions. Word has length 22 [2025-04-29 11:23:02,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,529 INFO L485 AbstractCegarLoop]: Abstraction has 268 states and 380 transitions. [2025-04-29 11:23:02,529 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:02,530 INFO L278 IsEmpty]: Start isEmpty. Operand 268 states and 380 transitions. [2025-04-29 11:23:02,530 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:23:02,530 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,530 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:02,538 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:23:02,730 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:02,731 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:02,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2036164058, now seen corresponding path program 1 times [2025-04-29 11:23:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:02,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481980166] [2025-04-29 11:23:02,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:02,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:02,734 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:02,735 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:02,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:23:02,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:23:02,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:23:02,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:02,791 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:02,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:02,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:02,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481980166] [2025-04-29 11:23:02,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481980166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:02,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:02,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:02,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873533292] [2025-04-29 11:23:02,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:02,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:02,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:02,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:02,792 INFO L87 Difference]: Start difference. First operand 268 states and 380 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,797 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2025-04-29 11:23:02,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:02,800 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:02,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,800 INFO L225 Difference]: With dead ends: 197 [2025-04-29 11:23:02,800 INFO L226 Difference]: Without dead ends: 197 [2025-04-29 11:23:02,801 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:02,801 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-29 11:23:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-04-29 11:23:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 170 states have (on average 1.4294117647058824) internal successors, (243), 184 states have internal predecessors, (243), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2025-04-29 11:23:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 265 transitions. [2025-04-29 11:23:02,806 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 265 transitions. Word has length 25 [2025-04-29 11:23:02,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,807 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 265 transitions. [2025-04-29 11:23:02,807 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:02,807 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 265 transitions. [2025-04-29 11:23:02,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:02,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,808 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:02,814 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:03,008 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:03,009 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:03,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash -72255190, now seen corresponding path program 1 times [2025-04-29 11:23:03,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:03,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184631117] [2025-04-29 11:23:03,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:03,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:03,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:03,011 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:03,012 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:03,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:03,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:03,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:03,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:03,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:23:03,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:03,201 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-29 11:23:03,202 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:03,318 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:03,355 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:03,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:03,475 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-29 11:23:03,475 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:07,947 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-29 11:23:07,947 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:08,024 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:08,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:08,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184631117] [2025-04-29 11:23:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184631117] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:08,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-04-29 11:23:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777451317] [2025-04-29 11:23:08,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:08,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:23:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:08,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:23:08,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-04-29 11:23:08,026 INFO L87 Difference]: Start difference. First operand 197 states and 265 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:10,702 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:23:13,151 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-29 11:23:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:14,289 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2025-04-29 11:23:14,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:23:14,290 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:14,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:14,291 INFO L225 Difference]: With dead ends: 220 [2025-04-29 11:23:14,291 INFO L226 Difference]: Without dead ends: 220 [2025-04-29 11:23:14,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=119, Invalid=217, Unknown=6, NotChecked=0, Total=342 [2025-04-29 11:23:14,291 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 33 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:14,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 77 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 92 Invalid, 9 Unknown, 0 Unchecked, 5.2s Time] [2025-04-29 11:23:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-04-29 11:23:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2025-04-29 11:23:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 195 states have internal predecessors, (241), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2025-04-29 11:23:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 265 transitions. [2025-04-29 11:23:14,296 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 265 transitions. Word has length 27 [2025-04-29 11:23:14,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:14,296 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 265 transitions. [2025-04-29 11:23:14,296 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:14,296 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2025-04-29 11:23:14,297 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:14,297 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:14,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:14,303 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:14,497 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:14,498 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:14,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1506398064, now seen corresponding path program 1 times [2025-04-29 11:23:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:14,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010243474] [2025-04-29 11:23:14,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:14,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:14,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:14,500 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:14,501 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:14,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:14,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:14,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:14,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:23:14,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:15,140 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:23:15,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:15,957 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:23:15,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:15,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010243474] [2025-04-29 11:23:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010243474] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:15,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-04-29 11:23:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931438063] [2025-04-29 11:23:15,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:15,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:23:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:15,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:23:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:23:15,959 INFO L87 Difference]: Start difference. First operand 208 states and 265 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:23:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:17,412 INFO L93 Difference]: Finished difference Result 313 states and 367 transitions. [2025-04-29 11:23:17,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:23:17,412 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-04-29 11:23:17,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:17,413 INFO L225 Difference]: With dead ends: 313 [2025-04-29 11:23:17,413 INFO L226 Difference]: Without dead ends: 313 [2025-04-29 11:23:17,414 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:23:17,414 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 216 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:17,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 213 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-29 11:23:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-04-29 11:23:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 280. [2025-04-29 11:23:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 250 states have (on average 1.296) internal successors, (324), 265 states have internal predecessors, (324), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-04-29 11:23:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 347 transitions. [2025-04-29 11:23:17,419 INFO L79 Accepts]: Start accepts. Automaton has 280 states and 347 transitions. Word has length 28 [2025-04-29 11:23:17,419 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:17,419 INFO L485 AbstractCegarLoop]: Abstraction has 280 states and 347 transitions. [2025-04-29 11:23:17,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:23:17,420 INFO L278 IsEmpty]: Start isEmpty. Operand 280 states and 347 transitions. [2025-04-29 11:23:17,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:23:17,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:17,420 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:17,426 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:17,624 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:17,624 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:17,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:17,624 INFO L85 PathProgramCache]: Analyzing trace with hash -717762487, now seen corresponding path program 1 times [2025-04-29 11:23:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:17,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646152200] [2025-04-29 11:23:17,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:17,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:17,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:17,627 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:17,628 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:17,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:23:17,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:23:17,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:17,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:17,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:23:17,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:19,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:19,283 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,839 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:19,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:24,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:24,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646152200] [2025-04-29 11:23:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646152200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:24,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [636084390] [2025-04-29 11:23:24,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:24,672 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-04-29 11:23:24,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-04-29 11:23:24,675 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-04-29 11:23:24,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-04-29 11:23:24,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:23:24,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:23:24,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:24,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:23:24,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... Killed by 15