./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/head-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/head-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 0e88082971628d59ef5682895c2d853cfcbbf7f0162214aa0affb543a2978ac5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:13:53,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:13:53,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:13:53,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:13:53,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:13:53,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:13:53,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:13:53,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:13:53,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:13:53,548 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:13:53,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:13:53,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:13:53,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:13:53,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:13:53,549 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:13:53,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:13:53,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:13:53,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:13:53,549 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:13:53,549 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:13:53,550 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:13:53,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:13:53,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:13:53,550 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:13:53,550 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:13:53,550 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:13:53,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:13:53,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:13:53,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:13:53,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:13:53,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:53,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:13:53,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:13:53,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:13:53,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:13:53,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:13:53,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:13:53,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:13:53,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:13:53,552 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e88082971628d59ef5682895c2d853cfcbbf7f0162214aa0affb543a2978ac5 [2025-03-04 09:13:53,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:13:53,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:13:53,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:13:53,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:13:53,771 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:13:53,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-1.i [2025-03-04 09:13:54,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa40757ff/cf25402e42a147c881c51438523569b9/FLAGeb7bf2f5d [2025-03-04 09:13:55,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:13:55,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-1.i [2025-03-04 09:13:55,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa40757ff/cf25402e42a147c881c51438523569b9/FLAGeb7bf2f5d [2025-03-04 09:13:55,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa40757ff/cf25402e42a147c881c51438523569b9 [2025-03-04 09:13:55,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:13:55,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:13:55,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:55,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:13:55,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:13:55,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:55" (1/1) ... [2025-03-04 09:13:55,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:55, skipping insertion in model container [2025-03-04 09:13:55,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:55" (1/1) ... [2025-03-04 09:13:55,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:13:56,168 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,171 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,172 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,175 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,175 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,178 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,182 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,183 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,184 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,185 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,191 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,193 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,195 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,196 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,197 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,198 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,198 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,199 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,199 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,200 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,205 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,206 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,214 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,218 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,219 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,225 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,227 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,230 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,232 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,235 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,237 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,238 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,239 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,239 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,240 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,241 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,241 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,249 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,256 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,269 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:56,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:56,317 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:13:56,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:56,569 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 09:13:56,577 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:13:56,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56 WrapperNode [2025-03-04 09:13:56,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:56,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:56,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:13:56,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:13:56,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,673 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1393 [2025-03-04 09:13:56,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:56,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:13:56,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:13:56,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:13:56,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,750 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [2, 20, 3, 3, 7, 2, 2, 9, 3, 47, 24, 10, 4, 355, 18, 1, 9, 32, 15]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 4, 0, 3, 0, 2, 0, 1, 0, 2, 0, 7, 1, 355, 0, 0, 0, 2, 0]. The 120 writes are split as follows [0, 15, 3, 0, 7, 0, 1, 4, 0, 35, 21, 0, 1, 0, 4, 1, 6, 21, 1]. [2025-03-04 09:13:56,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:13:56,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:13:56,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:13:56,866 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:13:56,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (1/1) ... [2025-03-04 09:13:56,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:56,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:13:56,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:13:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 09:13:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 09:13:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 09:13:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 09:13:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 09:13:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 09:13:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 09:13:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 09:13:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 09:13:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 09:13:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 09:13:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 09:13:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 09:13:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 09:13:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 09:13:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 09:13:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 09:13:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 09:13:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 09:13:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-03-04 09:13:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-04 09:13:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-04 09:13:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:13:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 09:13:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 09:13:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 09:13:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 09:13:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 09:13:56,960 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 09:13:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 09:13:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:13:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 09:13:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 09:13:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 09:13:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 09:13:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 09:13:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 09:13:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 09:13:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 09:13:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-03-04 09:13:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 09:13:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 09:13:56,968 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:13:56,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 09:13:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-03-04 09:13:56,969 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 09:13:56,969 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 09:13:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 09:13:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 09:13:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 09:13:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 09:13:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 09:13:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 09:13:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 09:13:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 09:13:57,415 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:13:57,417 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:13:57,682 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2860: havoc #t~nondet150; [2025-03-04 09:13:58,390 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2770: call ULTIMATE.dealloc(~#i~0#1.base, ~#i~0#1.offset);havoc ~#i~0#1.base, ~#i~0#1.offset; [2025-03-04 09:14:03,890 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-03-04 09:14:03,890 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: call ULTIMATE.dealloc(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset);havoc __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset; [2025-03-04 09:14:04,104 INFO L? ?]: Removed 960 outVars from TransFormulas that were not future-live. [2025-03-04 09:14:04,106 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:14:04,157 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:14:04,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:14:04,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:14:04 BoogieIcfgContainer [2025-03-04 09:14:04,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:14:04,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:14:04,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:14:04,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:14:04,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:13:55" (1/3) ... [2025-03-04 09:14:04,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfcf9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:14:04, skipping insertion in model container [2025-03-04 09:14:04,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:56" (2/3) ... [2025-03-04 09:14:04,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfcf9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:14:04, skipping insertion in model container [2025-03-04 09:14:04,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:14:04" (3/3) ... [2025-03-04 09:14:04,165 INFO L128 eAbstractionObserver]: Analyzing ICFG head-1.i [2025-03-04 09:14:04,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:14:04,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-1.i that has 48 procedures, 1054 locations, 1 initial locations, 41 loop locations, and 359 error locations. [2025-03-04 09:14:04,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:14:04,237 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34d62c14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:14:04,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 359 error locations. [2025-03-04 09:14:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 715 states, 423 states have (on average 1.8817966903073287) internal successors, (796), 677 states have internal predecessors, (796), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 09:14:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:14:04,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:04,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:14:04,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1340517, now seen corresponding path program 1 times [2025-03-04 09:14:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:04,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29905783] [2025-03-04 09:14:04,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:04,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:14:05,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:14:05,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:05,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:05,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:05,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29905783] [2025-03-04 09:14:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29905783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:05,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:05,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:14:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956353363] [2025-03-04 09:14:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:05,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:05,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:05,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:05,533 INFO L87 Difference]: Start difference. First operand has 715 states, 423 states have (on average 1.8817966903073287) internal successors, (796), 677 states have internal predecessors, (796), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:09,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:10,605 INFO L93 Difference]: Finished difference Result 699 states and 833 transitions. [2025-03-04 09:14:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:10,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:14:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:10,619 INFO L225 Difference]: With dead ends: 699 [2025-03-04 09:14:10,620 INFO L226 Difference]: Without dead ends: 699 [2025-03-04 09:14:10,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:10,622 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 293 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:10,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 817 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 273 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-04 09:14:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-04 09:14:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 493. [2025-03-04 09:14:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 303 states have (on average 1.7755775577557755) internal successors, (538), 465 states have internal predecessors, (538), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 579 transitions. [2025-03-04 09:14:10,671 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 579 transitions. Word has length 3 [2025-03-04 09:14:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:10,671 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 579 transitions. [2025-03-04 09:14:10,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 579 transitions. [2025-03-04 09:14:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:14:10,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:10,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:14:10,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:14:10,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1340518, now seen corresponding path program 1 times [2025-03-04 09:14:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347860698] [2025-03-04 09:14:10,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:10,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:14:11,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:14:11,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:11,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347860698] [2025-03-04 09:14:11,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347860698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:11,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:11,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:14:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147245798] [2025-03-04 09:14:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:11,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:11,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:11,539 INFO L87 Difference]: Start difference. First operand 493 states and 579 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:15,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:16,187 INFO L93 Difference]: Finished difference Result 492 states and 578 transitions. [2025-03-04 09:14:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:16,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:14:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:16,189 INFO L225 Difference]: With dead ends: 492 [2025-03-04 09:14:16,190 INFO L226 Difference]: Without dead ends: 492 [2025-03-04 09:14:16,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:16,190 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 10 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:16,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 979 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 09:14:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-04 09:14:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-03-04 09:14:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 303 states have (on average 1.7722772277227723) internal successors, (537), 464 states have internal predecessors, (537), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 578 transitions. [2025-03-04 09:14:16,202 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 578 transitions. Word has length 3 [2025-03-04 09:14:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:16,202 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 578 transitions. [2025-03-04 09:14:16,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 578 transitions. [2025-03-04 09:14:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:14:16,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:16,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:14:16,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:14:16,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:16,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1281912254, now seen corresponding path program 1 times [2025-03-04 09:14:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:16,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546003999] [2025-03-04 09:14:16,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:16,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:14:16,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:14:16,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:16,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:17,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:17,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546003999] [2025-03-04 09:14:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546003999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:17,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:17,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:14:17,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336998790] [2025-03-04 09:14:17,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:17,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:14:17,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:17,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:14:17,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:14:17,167 INFO L87 Difference]: Start difference. First operand 492 states and 578 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:21,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:25,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:26,085 INFO L93 Difference]: Finished difference Result 495 states and 581 transitions. [2025-03-04 09:14:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:14:26,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:14:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:26,087 INFO L225 Difference]: With dead ends: 495 [2025-03-04 09:14:26,087 INFO L226 Difference]: Without dead ends: 495 [2025-03-04 09:14:26,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:14:26,088 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 11 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:26,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 979 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2025-03-04 09:14:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-04 09:14:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2025-03-04 09:14:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 305 states have (on average 1.7672131147540984) internal successors, (539), 466 states have internal predecessors, (539), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 580 transitions. [2025-03-04 09:14:26,101 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 580 transitions. Word has length 6 [2025-03-04 09:14:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:26,101 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 580 transitions. [2025-03-04 09:14:26,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 580 transitions. [2025-03-04 09:14:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:14:26,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:26,102 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:26,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:14:26,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:26,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:26,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1399995743, now seen corresponding path program 1 times [2025-03-04 09:14:26,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971693196] [2025-03-04 09:14:26,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:26,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:14:26,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:14:26,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:26,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971693196] [2025-03-04 09:14:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971693196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763464439] [2025-03-04 09:14:27,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:27,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:27,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:27,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:27,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:14:28,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:14:28,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:14:28,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:28,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:28,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:14:28,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:28,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:28,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 09:14:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:28,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763464439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:28,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:14:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929114781] [2025-03-04 09:14:28,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:28,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:14:28,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:28,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:14:28,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:14:28,853 INFO L87 Difference]: Start difference. First operand 494 states and 580 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:32,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:36,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:40,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:44,312 INFO L93 Difference]: Finished difference Result 498 states and 584 transitions. [2025-03-04 09:14:44,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:14:44,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:14:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:44,315 INFO L225 Difference]: With dead ends: 498 [2025-03-04 09:14:44,315 INFO L226 Difference]: Without dead ends: 498 [2025-03-04 09:14:44,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:14:44,317 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 796 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:44,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2070 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 636 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2025-03-04 09:14:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-04 09:14:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-04 09:14:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 310 states have (on average 1.7516129032258065) internal successors, (543), 470 states have internal predecessors, (543), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 584 transitions. [2025-03-04 09:14:44,335 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 584 transitions. Word has length 9 [2025-03-04 09:14:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:44,335 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 584 transitions. [2025-03-04 09:14:44,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 584 transitions. [2025-03-04 09:14:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 09:14:44,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:44,336 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:44,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:14:44,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:44,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:44,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1461977888, now seen corresponding path program 1 times [2025-03-04 09:14:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075931935] [2025-03-04 09:14:44,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:45,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:14:45,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:14:45,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:45,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:45,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:45,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075931935] [2025-03-04 09:14:45,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075931935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:45,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661063468] [2025-03-04 09:14:45,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:45,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:45,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:45,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:45,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:14:46,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:14:46,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:14:46,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:46,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:14:46,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:46,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661063468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:46,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 09:14:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143457714] [2025-03-04 09:14:46,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:46,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:14:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:46,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:14:46,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:14:46,791 INFO L87 Difference]: Start difference. First operand 498 states and 584 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:46,984 INFO L93 Difference]: Finished difference Result 513 states and 599 transitions. [2025-03-04 09:14:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:14:46,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 09:14:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:46,987 INFO L225 Difference]: With dead ends: 513 [2025-03-04 09:14:46,987 INFO L226 Difference]: Without dead ends: 513 [2025-03-04 09:14:46,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:14:46,988 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 4 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:46,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2283 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-04 09:14:46,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2025-03-04 09:14:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 325 states have (on average 1.716923076923077) internal successors, (558), 485 states have internal predecessors, (558), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 599 transitions. [2025-03-04 09:14:47,002 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 599 transitions. Word has length 15 [2025-03-04 09:14:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:47,002 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 599 transitions. [2025-03-04 09:14:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 599 transitions. [2025-03-04 09:14:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 09:14:47,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:47,003 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:47,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:14:47,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:47,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:47,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1103307165, now seen corresponding path program 2 times [2025-03-04 09:14:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:47,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336634546] [2025-03-04 09:14:47,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:47,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:47,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 09:14:47,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-03-04 09:14:47,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:14:47,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 09:14:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336634546] [2025-03-04 09:14:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336634546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:48,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:48,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:14:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499454016] [2025-03-04 09:14:48,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:48,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:14:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:48,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:14:48,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:14:48,109 INFO L87 Difference]: Start difference. First operand 513 states and 599 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:50,054 INFO L93 Difference]: Finished difference Result 879 states and 1049 transitions. [2025-03-04 09:14:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 09:14:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:50,059 INFO L225 Difference]: With dead ends: 879 [2025-03-04 09:14:50,059 INFO L226 Difference]: Without dead ends: 879 [2025-03-04 09:14:50,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:14:50,060 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 927 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:50,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 808 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:14:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-04 09:14:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 556. [2025-03-04 09:14:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 365 states have (on average 1.7123287671232876) internal successors, (625), 524 states have internal predecessors, (625), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 09:14:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 670 transitions. [2025-03-04 09:14:50,073 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 670 transitions. Word has length 30 [2025-03-04 09:14:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:50,074 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 670 transitions. [2025-03-04 09:14:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 670 transitions. [2025-03-04 09:14:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 09:14:50,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:50,074 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:14:50,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1103307166, now seen corresponding path program 1 times [2025-03-04 09:14:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91456450] [2025-03-04 09:14:50,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:50,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 09:14:50,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 09:14:50,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:50,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91456450] [2025-03-04 09:14:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91456450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131294373] [2025-03-04 09:14:51,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:51,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:51,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:51,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:51,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:14:52,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 09:14:52,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 09:14:52,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:52,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:52,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:14:52,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:52,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:53,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131294373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:53,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:53,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-04 09:14:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349977797] [2025-03-04 09:14:53,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:53,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:14:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:53,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:14:53,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:14:53,182 INFO L87 Difference]: Start difference. First operand 556 states and 670 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:53,390 INFO L93 Difference]: Finished difference Result 562 states and 676 transitions. [2025-03-04 09:14:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:14:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 09:14:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:53,393 INFO L225 Difference]: With dead ends: 562 [2025-03-04 09:14:53,394 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 09:14:53,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:14:53,394 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 2 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:53,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2279 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 09:14:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-04 09:14:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 371 states have (on average 1.7008086253369272) internal successors, (631), 530 states have internal predecessors, (631), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 09:14:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 676 transitions. [2025-03-04 09:14:53,404 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 676 transitions. Word has length 30 [2025-03-04 09:14:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:53,404 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 676 transitions. [2025-03-04 09:14:53,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 676 transitions. [2025-03-04 09:14:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:14:53,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:53,405 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:53,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:14:53,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:53,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:53,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1551863106, now seen corresponding path program 2 times [2025-03-04 09:14:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:53,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288281819] [2025-03-04 09:14:53,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:54,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:14:54,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 09:14:54,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:14:54,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:54,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:54,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288281819] [2025-03-04 09:14:54,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288281819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:54,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:54,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:14:54,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165113801] [2025-03-04 09:14:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:54,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:14:54,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:54,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:14:54,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:14:54,728 INFO L87 Difference]: Start difference. First operand 562 states and 676 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:14:58,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:15:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:02,599 INFO L93 Difference]: Finished difference Result 1137 states and 1363 transitions. [2025-03-04 09:15:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:02,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 09:15:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:02,603 INFO L225 Difference]: With dead ends: 1137 [2025-03-04 09:15:02,603 INFO L226 Difference]: Without dead ends: 1137 [2025-03-04 09:15:02,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:02,604 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1087 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:02,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1446 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 808 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2025-03-04 09:15:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-04 09:15:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 927. [2025-03-04 09:15:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 702 states have (on average 1.7293447293447293) internal successors, (1214), 866 states have internal predecessors, (1214), 50 states have call successors, (50), 24 states have call predecessors, (50), 21 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-04 09:15:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1309 transitions. [2025-03-04 09:15:02,622 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1309 transitions. Word has length 36 [2025-03-04 09:15:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:02,622 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1309 transitions. [2025-03-04 09:15:02,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1309 transitions. [2025-03-04 09:15:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:15:02,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:02,623 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:02,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:15:02,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:15:02,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1716375531, now seen corresponding path program 1 times [2025-03-04 09:15:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:02,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494750406] [2025-03-04 09:15:02,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:02,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:03,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:15:03,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:15:03,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:03,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:15:03,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494750406] [2025-03-04 09:15:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494750406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:03,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:03,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:15:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893621725] [2025-03-04 09:15:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:03,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:03,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:03,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:03,497 INFO L87 Difference]: Start difference. First operand 927 states and 1309 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:15:07,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:15:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:08,847 INFO L93 Difference]: Finished difference Result 996 states and 1305 transitions. [2025-03-04 09:15:08,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:08,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 09:15:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:08,851 INFO L225 Difference]: With dead ends: 996 [2025-03-04 09:15:08,851 INFO L226 Difference]: Without dead ends: 996 [2025-03-04 09:15:08,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:08,851 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 273 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:08,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 825 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 271 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-04 09:15:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-04 09:15:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 922. [2025-03-04 09:15:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 702 states have (on average 1.7222222222222223) internal successors, (1209), 861 states have internal predecessors, (1209), 50 states have call successors, (50), 24 states have call predecessors, (50), 21 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-04 09:15:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1304 transitions. [2025-03-04 09:15:08,872 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1304 transitions. Word has length 44 [2025-03-04 09:15:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:08,873 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1304 transitions. [2025-03-04 09:15:08,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:15:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1304 transitions. [2025-03-04 09:15:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:15:08,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:08,873 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:08,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:15:08,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:15:08,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1716375532, now seen corresponding path program 1 times [2025-03-04 09:15:08,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:08,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732329811] [2025-03-04 09:15:08,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:09,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:15:09,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:15:09,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:09,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:15:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732329811] [2025-03-04 09:15:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732329811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:10,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:10,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:15:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162371306] [2025-03-04 09:15:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:10,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:15:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:10,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:15:10,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:10,436 INFO L87 Difference]: Start difference. First operand 922 states and 1304 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:15:14,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:15:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:15,576 INFO L93 Difference]: Finished difference Result 922 states and 1305 transitions. [2025-03-04 09:15:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:15:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 09:15:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:15,580 INFO L225 Difference]: With dead ends: 922 [2025-03-04 09:15:15,580 INFO L226 Difference]: Without dead ends: 922 [2025-03-04 09:15:15,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:15,580 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 750 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:15,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 2251 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 201 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-04 09:15:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-04 09:15:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 921. [2025-03-04 09:15:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 702 states have (on average 1.7207977207977208) internal successors, (1208), 860 states have internal predecessors, (1208), 50 states have call successors, (50), 24 states have call predecessors, (50), 21 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-04 09:15:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1303 transitions. [2025-03-04 09:15:15,602 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1303 transitions. Word has length 44 [2025-03-04 09:15:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:15,602 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1303 transitions. [2025-03-04 09:15:15,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:15:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1303 transitions. [2025-03-04 09:15:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:15:15,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:15,604 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:15,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:15:15,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:15:15,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash 959045224, now seen corresponding path program 1 times [2025-03-04 09:15:15,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:15,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987353393] [2025-03-04 09:15:15,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:16,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:15:16,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:15:16,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:16,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:15:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987353393] [2025-03-04 09:15:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987353393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:16,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:16,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:15:16,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301229850] [2025-03-04 09:15:16,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:16,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:15:16,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:16,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:15:16,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:16,665 INFO L87 Difference]: Start difference. First operand 921 states and 1303 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:15:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:18,471 INFO L93 Difference]: Finished difference Result 1014 states and 1326 transitions. [2025-03-04 09:15:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:15:18,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 09:15:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:18,474 INFO L225 Difference]: With dead ends: 1014 [2025-03-04 09:15:18,474 INFO L226 Difference]: Without dead ends: 1014 [2025-03-04 09:15:18,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:18,475 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 953 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:18,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 990 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:15:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-03-04 09:15:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 935. [2025-03-04 09:15:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 716 states have (on average 1.717877094972067) internal successors, (1230), 874 states have internal predecessors, (1230), 50 states have call successors, (50), 24 states have call predecessors, (50), 21 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-04 09:15:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1325 transitions. [2025-03-04 09:15:18,489 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1325 transitions. Word has length 47 [2025-03-04 09:15:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:18,490 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1325 transitions. [2025-03-04 09:15:18,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:15:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1325 transitions. [2025-03-04 09:15:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:15:18,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:18,491 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:18,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:15:18,491 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:15:18,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash 959044295, now seen corresponding path program 1 times [2025-03-04 09:15:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648556970] [2025-03-04 09:15:18,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:18,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:18,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:15:18,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:15:18,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:18,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:15:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:19,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648556970] [2025-03-04 09:15:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648556970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:19,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:19,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:15:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553170851] [2025-03-04 09:15:19,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:19,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:15:19,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:19,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:15:19,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:15:19,228 INFO L87 Difference]: Start difference. First operand 935 states and 1325 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:15:23,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []