./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/usleep-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/usleep-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 92819ed386f0d70ff4609309e3718a41b6a1b41ff8c4c600c8db8bc7b56921e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:06:16,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:06:16,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:06:16,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:06:16,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:06:16,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:06:16,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:06:16,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:06:16,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:06:16,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:06:16,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:06:16,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:06:16,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:06:16,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:06:16,665 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:06:16,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:06:16,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:06:16,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:06:16,665 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:06:16,665 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:06:16,666 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:06:16,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:06:16,666 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:06:16,666 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:06:16,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:06:16,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:06:16,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:06:16,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:06:16,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:06:16,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:06:16,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:06:16,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:06:16,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:06:16,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:06:16,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:06:16,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:06:16,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:06:16,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:06:16,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:06:16,668 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-jdk21/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 -> 92819ed386f0d70ff4609309e3718a41b6a1b41ff8c4c600c8db8bc7b56921e0 [2025-02-06 12:06:16,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:06:16,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:06:16,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:06:16,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:06:16,936 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:06:16,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/usleep-2.i [2025-02-06 12:06:18,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80c7de00c/45607bb4827b405dad913cd9fca19b73/FLAGeb7aa982e [2025-02-06 12:06:18,543 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:06:18,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/usleep-2.i [2025-02-06 12:06:18,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80c7de00c/45607bb4827b405dad913cd9fca19b73/FLAGeb7aa982e [2025-02-06 12:06:18,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80c7de00c/45607bb4827b405dad913cd9fca19b73 [2025-02-06 12:06:18,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:06:18,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:06:18,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:06:18,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:06:18,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:06:18,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:06:18" (1/1) ... [2025-02-06 12:06:18,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364cbd9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:18, skipping insertion in model container [2025-02-06 12:06:18,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:06:18" (1/1) ... [2025-02-06 12:06:18,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:06:19,497 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,503 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,505 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,506 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,507 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,507 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,508 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,508 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,509 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,511 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,512 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,517 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,517 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,532 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,534 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,541 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,552 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,573 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:06:19,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:06:19,618 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:06:19,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:06:19,875 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 12:06:19,881 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:06:19,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19 WrapperNode [2025-02-06 12:06:19,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:06:19,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:06:19,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:06:19,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:06:19,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:19,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:19,993 INFO L138 Inliner]: procedures = 598, calls = 512, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 889 [2025-02-06 12:06:19,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:06:19,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:06:19,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:06:19,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:06:20,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,049 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 12:06:20,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:06:20,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:06:20,128 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:06:20,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:06:20,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (1/1) ... [2025-02-06 12:06:20,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:06:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:06:20,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:06:20,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:06:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:06:20,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 12:06:20,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 12:06:20,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 12:06:20,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:06:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:06:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 12:06:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:06:20,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:06:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 12:06:20,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 12:06:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 12:06:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 12:06:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:06:20,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:06:20,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:06:20,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 12:06:20,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 12:06:20,185 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 12:06:20,185 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 12:06:20,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 12:06:20,425 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:06:20,427 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:06:21,155 INFO L? ?]: Removed 438 outVars from TransFormulas that were not future-live. [2025-02-06 12:06:21,156 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:06:21,172 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:06:21,173 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:06:21,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:06:21 BoogieIcfgContainer [2025-02-06 12:06:21,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:06:21,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:06:21,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:06:21,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:06:21,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:06:18" (1/3) ... [2025-02-06 12:06:21,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dff4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:06:21, skipping insertion in model container [2025-02-06 12:06:21,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:06:19" (2/3) ... [2025-02-06 12:06:21,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dff4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:06:21, skipping insertion in model container [2025-02-06 12:06:21,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:06:21" (3/3) ... [2025-02-06 12:06:21,180 INFO L128 eAbstractionObserver]: Analyzing ICFG usleep-2.i [2025-02-06 12:06:21,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:06:21,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usleep-2.i that has 4 procedures, 377 locations, 1 initial locations, 12 loop locations, and 155 error locations. [2025-02-06 12:06:21,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:06:21,229 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;@7fe2347b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:06:21,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 155 error locations. [2025-02-06 12:06:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 377 states, 210 states have (on average 1.9523809523809523) internal successors, (410), 365 states have internal predecessors, (410), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 12:06:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:06:21,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:21,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:06:21,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:21,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash 484551, now seen corresponding path program 1 times [2025-02-06 12:06:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:21,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868403617] [2025-02-06 12:06:21,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:21,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:06:21,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:06:21,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:21,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:21,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:21,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868403617] [2025-02-06 12:06:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868403617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:06:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000724038] [2025-02-06 12:06:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:06:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:21,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:06:21,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:21,722 INFO L87 Difference]: Start difference. First operand has 377 states, 210 states have (on average 1.9523809523809523) internal successors, (410), 365 states have internal predecessors, (410), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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-02-06 12:06:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:21,872 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2025-02-06 12:06:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:21,874 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-02-06 12:06:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:21,879 INFO L225 Difference]: With dead ends: 228 [2025-02-06 12:06:21,879 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 12:06:21,880 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-02-06 12:06:21,882 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 167 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:21,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 193 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 12:06:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 209. [2025-02-06 12:06:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 116 states have (on average 1.9137931034482758) internal successors, (222), 204 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 228 transitions. [2025-02-06 12:06:21,912 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 228 transitions. Word has length 3 [2025-02-06 12:06:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:21,912 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 228 transitions. [2025-02-06 12:06:21,913 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-02-06 12:06:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 228 transitions. [2025-02-06 12:06:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:06:21,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:21,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:06:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:06:21,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash 484552, now seen corresponding path program 1 times [2025-02-06 12:06:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704740389] [2025-02-06 12:06:21,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:21,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:06:21,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:06:21,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:21,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:22,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:22,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704740389] [2025-02-06 12:06:22,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704740389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:22,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:22,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:06:22,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864671974] [2025-02-06 12:06:22,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:22,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:06:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:22,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:06:22,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:22,193 INFO L87 Difference]: Start difference. First operand 209 states and 228 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-02-06 12:06:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:22,315 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2025-02-06 12:06:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:22,316 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-02-06 12:06:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:22,317 INFO L225 Difference]: With dead ends: 208 [2025-02-06 12:06:22,317 INFO L226 Difference]: Without dead ends: 208 [2025-02-06 12:06:22,317 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-02-06 12:06:22,318 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 10 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:22,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-06 12:06:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-02-06 12:06:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 116 states have (on average 1.9051724137931034) internal successors, (221), 203 states have internal predecessors, (221), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 227 transitions. [2025-02-06 12:06:22,328 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 227 transitions. Word has length 3 [2025-02-06 12:06:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 227 transitions. [2025-02-06 12:06:22,328 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-02-06 12:06:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 227 transitions. [2025-02-06 12:06:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:06:22,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:22,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:06:22,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:06:22,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:22,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1550776958, now seen corresponding path program 1 times [2025-02-06 12:06:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:22,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113951688] [2025-02-06 12:06:22,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:22,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:22,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:06:22,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:06:22,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:22,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:22,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:22,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113951688] [2025-02-06 12:06:22,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113951688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:22,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:06:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237443820] [2025-02-06 12:06:22,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:22,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:06:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:22,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:06:22,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:06:22,643 INFO L87 Difference]: Start difference. First operand 208 states and 227 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-02-06 12:06:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:22,775 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2025-02-06 12:06:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:06:22,775 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-02-06 12:06:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:22,776 INFO L225 Difference]: With dead ends: 211 [2025-02-06 12:06:22,776 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 12:06:22,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:06:22,777 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 11 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:22,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 352 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 12:06:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2025-02-06 12:06:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 118 states have (on average 1.8898305084745763) internal successors, (223), 205 states have internal predecessors, (223), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 229 transitions. [2025-02-06 12:06:22,784 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 229 transitions. Word has length 6 [2025-02-06 12:06:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 229 transitions. [2025-02-06 12:06:22,784 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-02-06 12:06:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 229 transitions. [2025-02-06 12:06:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:06:22,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:22,785 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:06:22,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:22,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1766461885, now seen corresponding path program 1 times [2025-02-06 12:06:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:22,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388939135] [2025-02-06 12:06:22,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:22,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:06:22,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:06:22,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:22,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388939135] [2025-02-06 12:06:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388939135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:06:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832808739] [2025-02-06 12:06:23,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:23,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:23,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:06:23,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:06:23,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:06:23,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:06:23,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:06:23,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:23,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:23,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:06:23,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:06:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:23,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:06:23,624 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-02-06 12:06:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832808739] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:06:23,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:06:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:06:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065791867] [2025-02-06 12:06:23,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:06:23,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:06:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:23,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:06:23,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:06:23,649 INFO L87 Difference]: Start difference. First operand 210 states and 229 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-02-06 12:06:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:24,071 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2025-02-06 12:06:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:06:24,072 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-02-06 12:06:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:24,073 INFO L225 Difference]: With dead ends: 214 [2025-02-06 12:06:24,074 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 12:06:24,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:06:24,075 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 396 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:24,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 869 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:06:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 12:06:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-02-06 12:06:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 123 states have (on average 1.8455284552845528) internal successors, (227), 209 states have internal predecessors, (227), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 233 transitions. [2025-02-06 12:06:24,092 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 233 transitions. Word has length 9 [2025-02-06 12:06:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:24,092 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 233 transitions. [2025-02-06 12:06:24,092 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-02-06 12:06:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 233 transitions. [2025-02-06 12:06:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 12:06:24,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:24,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:24,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 12:06:24,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:24,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:24,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1968180286, now seen corresponding path program 1 times [2025-02-06 12:06:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:24,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627882027] [2025-02-06 12:06:24,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:24,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:06:24,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:06:24,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:24,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627882027] [2025-02-06 12:06:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627882027] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:06:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648302296] [2025-02-06 12:06:24,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:24,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:24,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:06:24,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:06:24,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:06:24,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:06:24,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:06:24,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:24,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:24,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:06:24,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:06:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:24,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:06:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:24,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648302296] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:06:24,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:06:24,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 12:06:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859122528] [2025-02-06 12:06:24,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:06:24,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:06:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:24,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:06:24,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:06:24,810 INFO L87 Difference]: Start difference. First operand 214 states and 233 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-02-06 12:06:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:24,847 INFO L93 Difference]: Finished difference Result 229 states and 248 transitions. [2025-02-06 12:06:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:06:24,848 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-02-06 12:06:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:24,849 INFO L225 Difference]: With dead ends: 229 [2025-02-06 12:06:24,849 INFO L226 Difference]: Without dead ends: 229 [2025-02-06 12:06:24,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:06:24,850 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 4 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:24,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 663 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:06:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-06 12:06:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-06 12:06:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 138 states have (on average 1.7536231884057971) internal successors, (242), 224 states have internal predecessors, (242), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 248 transitions. [2025-02-06 12:06:24,856 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 248 transitions. Word has length 15 [2025-02-06 12:06:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:24,856 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 248 transitions. [2025-02-06 12:06:24,856 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-02-06 12:06:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 248 transitions. [2025-02-06 12:06:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:06:24,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:24,857 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:24,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:06:25,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:25,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:25,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1331577181, now seen corresponding path program 2 times [2025-02-06 12:06:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:25,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326374834] [2025-02-06 12:06:25,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:06:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:25,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:06:25,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-02-06 12:06:25,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:06:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-06 12:06:25,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:25,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326374834] [2025-02-06 12:06:25,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326374834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:25,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:25,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:06:25,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363809524] [2025-02-06 12:06:25,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:25,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:06:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:25,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:06:25,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:25,321 INFO L87 Difference]: Start difference. First operand 229 states and 248 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-02-06 12:06:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:25,436 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2025-02-06 12:06:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:25,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-02-06 12:06:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:25,438 INFO L225 Difference]: With dead ends: 249 [2025-02-06 12:06:25,438 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 12:06:25,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:25,439 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 179 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:25,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 259 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 12:06:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 232. [2025-02-06 12:06:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 141 states have (on average 1.7304964539007093) internal successors, (244), 226 states have internal predecessors, (244), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 250 transitions. [2025-02-06 12:06:25,451 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 250 transitions. Word has length 30 [2025-02-06 12:06:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 250 transitions. [2025-02-06 12:06:25,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-02-06 12:06:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 250 transitions. [2025-02-06 12:06:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:06:25,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:25,453 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:25,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:06:25,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:25,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1331577182, now seen corresponding path program 1 times [2025-02-06 12:06:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989216470] [2025-02-06 12:06:25,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:25,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:06:25,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:06:25,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:25,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:25,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989216470] [2025-02-06 12:06:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989216470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:06:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609391561] [2025-02-06 12:06:25,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:25,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:06:25,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:06:25,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:06:25,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:06:26,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:06:26,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:26,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:26,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:06:26,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:06:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:26,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:06:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:06:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609391561] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:06:26,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:06:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-06 12:06:26,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608426159] [2025-02-06 12:06:26,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:06:26,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:06:26,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:26,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:06:26,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:06:26,147 INFO L87 Difference]: Start difference. First operand 232 states and 250 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-02-06 12:06:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:26,193 INFO L93 Difference]: Finished difference Result 238 states and 256 transitions. [2025-02-06 12:06:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:06:26,194 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-02-06 12:06:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:26,195 INFO L225 Difference]: With dead ends: 238 [2025-02-06 12:06:26,195 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 12:06:26,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:06:26,195 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 2 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:26,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1317 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:06:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 12:06:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-02-06 12:06:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 232 states have internal predecessors, (250), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 256 transitions. [2025-02-06 12:06:26,201 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 256 transitions. Word has length 30 [2025-02-06 12:06:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:26,201 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 256 transitions. [2025-02-06 12:06:26,201 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-02-06 12:06:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 256 transitions. [2025-02-06 12:06:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:06:26,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:26,202 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:26,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:06:26,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:26,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:26,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1857769278, now seen corresponding path program 2 times [2025-02-06 12:06:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:26,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922230140] [2025-02-06 12:06:26,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:06:26,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:26,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:06:26,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-02-06 12:06:26,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:06:26,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922230140] [2025-02-06 12:06:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922230140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:06:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754245566] [2025-02-06 12:06:26,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:26,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:06:26,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:26,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:06:26,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:06:26,626 INFO L87 Difference]: Start difference. First operand 238 states and 256 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-02-06 12:06:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:26,821 INFO L93 Difference]: Finished difference Result 254 states and 273 transitions. [2025-02-06 12:06:26,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:26,822 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-02-06 12:06:26,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:26,823 INFO L225 Difference]: With dead ends: 254 [2025-02-06 12:06:26,823 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 12:06:26,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:26,823 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 605 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:26,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 146 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:06:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 12:06:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 237. [2025-02-06 12:06:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 147 states have (on average 1.6938775510204083) internal successors, (249), 231 states have internal predecessors, (249), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 255 transitions. [2025-02-06 12:06:26,828 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 255 transitions. Word has length 36 [2025-02-06 12:06:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:26,828 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 255 transitions. [2025-02-06 12:06:26,828 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-02-06 12:06:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 255 transitions. [2025-02-06 12:06:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:06:26,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:26,829 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:26,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:06:26,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:26,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:26,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1976916299, now seen corresponding path program 1 times [2025-02-06 12:06:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:26,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283381721] [2025-02-06 12:06:26,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:26,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:26,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:06:26,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:06:26,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:26,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283381721] [2025-02-06 12:06:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283381721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:27,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:06:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932807617] [2025-02-06 12:06:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:27,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:06:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:27,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:06:27,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:27,132 INFO L87 Difference]: Start difference. First operand 237 states and 255 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-02-06 12:06:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:27,258 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2025-02-06 12:06:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:27,260 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-02-06 12:06:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:27,261 INFO L225 Difference]: With dead ends: 249 [2025-02-06 12:06:27,261 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 12:06:27,261 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-02-06 12:06:27,262 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 147 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:27,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 195 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 12:06:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 232. [2025-02-06 12:06:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 147 states have (on average 1.6598639455782314) internal successors, (244), 226 states have internal predecessors, (244), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 250 transitions. [2025-02-06 12:06:27,270 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 250 transitions. Word has length 44 [2025-02-06 12:06:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:27,270 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 250 transitions. [2025-02-06 12:06:27,270 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-02-06 12:06:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 250 transitions. [2025-02-06 12:06:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:06:27,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:27,272 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:27,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:06:27,272 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:27,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1976916300, now seen corresponding path program 1 times [2025-02-06 12:06:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:27,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880797762] [2025-02-06 12:06:27,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:27,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:27,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:06:27,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:06:27,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:27,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880797762] [2025-02-06 12:06:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880797762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:27,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:06:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510828720] [2025-02-06 12:06:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:27,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:06:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:27,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:06:27,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:06:27,911 INFO L87 Difference]: Start difference. First operand 232 states and 250 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-02-06 12:06:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:28,055 INFO L93 Difference]: Finished difference Result 251 states and 272 transitions. [2025-02-06 12:06:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:06:28,056 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-02-06 12:06:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:28,057 INFO L225 Difference]: With dead ends: 251 [2025-02-06 12:06:28,058 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 12:06:28,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:06:28,059 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 209 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:28,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 782 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 12:06:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2025-02-06 12:06:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 147 states have (on average 1.653061224489796) internal successors, (243), 225 states have internal predecessors, (243), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2025-02-06 12:06:28,069 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 44 [2025-02-06 12:06:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:28,070 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2025-02-06 12:06:28,070 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-02-06 12:06:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2025-02-06 12:06:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:06:28,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:28,070 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-02-06 12:06:28,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:06:28,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:28,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1722304874, now seen corresponding path program 1 times [2025-02-06 12:06:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:28,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087075647] [2025-02-06 12:06:28,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:28,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:28,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:06:28,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:06:28,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:28,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:28,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:28,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087075647] [2025-02-06 12:06:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087075647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:28,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:28,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:06:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295906182] [2025-02-06 12:06:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:28,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:06:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:28,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:06:28,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:28,495 INFO L87 Difference]: Start difference. First operand 231 states and 249 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-02-06 12:06:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:28,755 INFO L93 Difference]: Finished difference Result 260 states and 282 transitions. [2025-02-06 12:06:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:28,756 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-02-06 12:06:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:28,757 INFO L225 Difference]: With dead ends: 260 [2025-02-06 12:06:28,757 INFO L226 Difference]: Without dead ends: 260 [2025-02-06 12:06:28,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:06:28,758 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 377 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:28,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 295 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:06:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-06 12:06:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 244. [2025-02-06 12:06:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 161 states have (on average 1.639751552795031) internal successors, (264), 238 states have internal predecessors, (264), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 270 transitions. [2025-02-06 12:06:28,763 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 270 transitions. Word has length 47 [2025-02-06 12:06:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:28,763 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 270 transitions. [2025-02-06 12:06:28,763 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-02-06 12:06:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 270 transitions. [2025-02-06 12:06:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:06:28,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:28,764 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-02-06 12:06:28,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:06:28,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:28,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1722303945, now seen corresponding path program 1 times [2025-02-06 12:06:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:28,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892882933] [2025-02-06 12:06:28,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:28,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:06:28,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:06:28,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:28,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:28,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892882933] [2025-02-06 12:06:28,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892882933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:28,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:28,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:06:28,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932132610] [2025-02-06 12:06:28,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:28,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:06:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:28,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:06:28,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:06:28,952 INFO L87 Difference]: Start difference. First operand 244 states and 270 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-02-06 12:06:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:29,104 INFO L93 Difference]: Finished difference Result 259 states and 286 transitions. [2025-02-06 12:06:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:06:29,105 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 47 [2025-02-06 12:06:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:29,106 INFO L225 Difference]: With dead ends: 259 [2025-02-06 12:06:29,106 INFO L226 Difference]: Without dead ends: 259 [2025-02-06 12:06:29,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:06:29,107 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 146 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:29,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 310 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-06 12:06:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 242. [2025-02-06 12:06:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 161 states have (on average 1.6273291925465838) internal successors, (262), 236 states have internal predecessors, (262), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2025-02-06 12:06:29,112 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 47 [2025-02-06 12:06:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:29,113 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2025-02-06 12:06:29,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-02-06 12:06:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2025-02-06 12:06:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:06:29,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:29,113 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-02-06 12:06:29,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:06:29,114 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1722303946, now seen corresponding path program 1 times [2025-02-06 12:06:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:29,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155257102] [2025-02-06 12:06:29,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:29,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:06:29,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:06:29,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:29,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155257102] [2025-02-06 12:06:29,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155257102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:29,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:29,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:06:29,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215281223] [2025-02-06 12:06:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:29,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:06:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:29,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:06:29,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:29,358 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand has 6 states, 6 states have (on average 3.0) 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-02-06 12:06:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:29,414 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2025-02-06 12:06:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) 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-02-06 12:06:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:29,416 INFO L225 Difference]: With dead ends: 247 [2025-02-06 12:06:29,416 INFO L226 Difference]: Without dead ends: 247 [2025-02-06 12:06:29,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:29,416 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 201 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:29,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 782 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:06:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-06 12:06:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 242. [2025-02-06 12:06:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 161 states have (on average 1.6211180124223603) internal successors, (261), 236 states have internal predecessors, (261), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 267 transitions. [2025-02-06 12:06:29,421 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 267 transitions. Word has length 47 [2025-02-06 12:06:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:29,422 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 267 transitions. [2025-02-06 12:06:29,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) 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-02-06 12:06:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 267 transitions. [2025-02-06 12:06:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:06:29,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:29,422 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, 1, 1, 1] [2025-02-06 12:06:29,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:06:29,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:29,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1505552614, now seen corresponding path program 1 times [2025-02-06 12:06:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240356028] [2025-02-06 12:06:29,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:29,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:06:29,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:06:29,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:29,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:29,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240356028] [2025-02-06 12:06:29,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240356028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:29,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:29,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:06:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125322770] [2025-02-06 12:06:29,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:29,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:06:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:29,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:06:29,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:29,654 INFO L87 Difference]: Start difference. First operand 242 states and 267 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 12:06:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:29,758 INFO L93 Difference]: Finished difference Result 248 states and 275 transitions. [2025-02-06 12:06:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2025-02-06 12:06:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:29,759 INFO L225 Difference]: With dead ends: 248 [2025-02-06 12:06:29,760 INFO L226 Difference]: Without dead ends: 248 [2025-02-06 12:06:29,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:29,760 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 138 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:29,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 191 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-06 12:06:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2025-02-06 12:06:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 167 states have (on average 1.6107784431137724) internal successors, (269), 241 states have internal predecessors, (269), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 275 transitions. [2025-02-06 12:06:29,766 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 275 transitions. Word has length 50 [2025-02-06 12:06:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:29,766 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 275 transitions. [2025-02-06 12:06:29,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 12:06:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 275 transitions. [2025-02-06 12:06:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:06:29,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:29,771 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, 1, 1, 1] [2025-02-06 12:06:29,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:06:29,771 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:29,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1505552615, now seen corresponding path program 1 times [2025-02-06 12:06:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:29,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037559130] [2025-02-06 12:06:29,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:29,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:29,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:06:29,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:06:29,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:29,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037559130] [2025-02-06 12:06:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037559130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:06:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680559484] [2025-02-06 12:06:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:30,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:06:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:30,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:06:30,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:06:30,287 INFO L87 Difference]: Start difference. First operand 247 states and 275 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-02-06 12:06:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:30,564 INFO L93 Difference]: Finished difference Result 257 states and 280 transitions. [2025-02-06 12:06:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 50 [2025-02-06 12:06:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:30,565 INFO L225 Difference]: With dead ends: 257 [2025-02-06 12:06:30,566 INFO L226 Difference]: Without dead ends: 257 [2025-02-06 12:06:30,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:06:30,567 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 366 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:30,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 292 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:06:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-06 12:06:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 247. [2025-02-06 12:06:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 167 states have (on average 1.6047904191616766) internal successors, (268), 241 states have internal predecessors, (268), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 274 transitions. [2025-02-06 12:06:30,574 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 274 transitions. Word has length 50 [2025-02-06 12:06:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:30,574 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 274 transitions. [2025-02-06 12:06:30,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-02-06 12:06:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 274 transitions. [2025-02-06 12:06:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:06:30,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:30,576 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, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:30,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:06:30,577 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:30,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash -425156318, now seen corresponding path program 1 times [2025-02-06 12:06:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184420484] [2025-02-06 12:06:30,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:30,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:06:30,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:06:30,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:30,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:30,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184420484] [2025-02-06 12:06:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184420484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:30,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:30,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:06:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597016523] [2025-02-06 12:06:30,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:30,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:06:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:30,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:06:30,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:06:30,969 INFO L87 Difference]: Start difference. First operand 247 states and 274 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-02-06 12:06:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:31,177 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2025-02-06 12:06:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:31,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-02-06 12:06:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:31,179 INFO L225 Difference]: With dead ends: 246 [2025-02-06 12:06:31,179 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 12:06:31,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:06:31,180 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 157 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:31,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 552 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:06:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 12:06:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-06 12:06:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 167 states have (on average 1.592814371257485) internal successors, (266), 240 states have internal predecessors, (266), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 272 transitions. [2025-02-06 12:06:31,184 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 272 transitions. Word has length 53 [2025-02-06 12:06:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:31,185 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 272 transitions. [2025-02-06 12:06:31,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-02-06 12:06:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 272 transitions. [2025-02-06 12:06:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:06:31,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:31,186 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, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:31,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:06:31,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:31,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -425156317, now seen corresponding path program 1 times [2025-02-06 12:06:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780473384] [2025-02-06 12:06:31,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:31,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:06:31,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:06:31,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:31,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:31,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780473384] [2025-02-06 12:06:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780473384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:31,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:31,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:06:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538254011] [2025-02-06 12:06:31,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:31,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:06:31,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:31,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:06:31,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:06:31,853 INFO L87 Difference]: Start difference. First operand 246 states and 272 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-02-06 12:06:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:32,098 INFO L93 Difference]: Finished difference Result 245 states and 270 transitions. [2025-02-06 12:06:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:32,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-02-06 12:06:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:32,099 INFO L225 Difference]: With dead ends: 245 [2025-02-06 12:06:32,099 INFO L226 Difference]: Without dead ends: 245 [2025-02-06 12:06:32,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:06:32,099 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 150 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 686 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:06:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-06 12:06:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-02-06 12:06:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 167 states have (on average 1.5808383233532934) internal successors, (264), 239 states have internal predecessors, (264), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 270 transitions. [2025-02-06 12:06:32,104 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 270 transitions. Word has length 53 [2025-02-06 12:06:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:32,105 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 270 transitions. [2025-02-06 12:06:32,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-02-06 12:06:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 270 transitions. [2025-02-06 12:06:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 12:06:32,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:32,105 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:32,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:06:32,106 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:32,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:32,106 INFO L85 PathProgramCache]: Analyzing trace with hash 839212502, now seen corresponding path program 1 times [2025-02-06 12:06:32,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:32,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010864273] [2025-02-06 12:06:32,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:32,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 12:06:32,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 12:06:32,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:32,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:32,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:32,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010864273] [2025-02-06 12:06:32,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010864273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:32,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:32,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:06:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561974165] [2025-02-06 12:06:32,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:32,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:06:32,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:32,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:06:32,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:32,227 INFO L87 Difference]: Start difference. First operand 245 states and 270 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02-06 12:06:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:32,240 INFO L93 Difference]: Finished difference Result 257 states and 285 transitions. [2025-02-06 12:06:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 57 [2025-02-06 12:06:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:32,241 INFO L225 Difference]: With dead ends: 257 [2025-02-06 12:06:32,241 INFO L226 Difference]: Without dead ends: 257 [2025-02-06 12:06:32,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:32,242 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 6 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:32,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 413 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:06:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-06 12:06:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 247. [2025-02-06 12:06:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 169 states have (on average 1.5739644970414202) internal successors, (266), 241 states have internal predecessors, (266), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 272 transitions. [2025-02-06 12:06:32,248 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 272 transitions. Word has length 57 [2025-02-06 12:06:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:32,248 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 272 transitions. [2025-02-06 12:06:32,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-02-06 12:06:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 272 transitions. [2025-02-06 12:06:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 12:06:32,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:32,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:32,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:06:32,249 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:32,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash 246030492, now seen corresponding path program 1 times [2025-02-06 12:06:32,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:32,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130851434] [2025-02-06 12:06:32,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:32,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 12:06:32,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 12:06:32,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:32,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:32,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130851434] [2025-02-06 12:06:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130851434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:32,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:32,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:06:32,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005408003] [2025-02-06 12:06:32,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:32,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:06:32,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:32,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:06:32,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:06:32,717 INFO L87 Difference]: Start difference. First operand 247 states and 272 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-02-06 12:06:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:33,044 INFO L93 Difference]: Finished difference Result 261 states and 287 transitions. [2025-02-06 12:06:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:06:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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 58 [2025-02-06 12:06:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:33,045 INFO L225 Difference]: With dead ends: 261 [2025-02-06 12:06:33,045 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 12:06:33,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:06:33,046 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 324 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:33,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 643 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:06:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 12:06:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2025-02-06 12:06:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.5714285714285714) internal successors, (275), 247 states have internal predecessors, (275), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 281 transitions. [2025-02-06 12:06:33,051 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 281 transitions. Word has length 58 [2025-02-06 12:06:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:33,052 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 281 transitions. [2025-02-06 12:06:33,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-02-06 12:06:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 281 transitions. [2025-02-06 12:06:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 12:06:33,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:33,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:33,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:06:33,054 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:33,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash 246030493, now seen corresponding path program 1 times [2025-02-06 12:06:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:33,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604655869] [2025-02-06 12:06:33,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:33,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 12:06:33,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 12:06:33,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:33,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:33,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604655869] [2025-02-06 12:06:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604655869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:33,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:33,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:06:33,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979451625] [2025-02-06 12:06:33,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:33,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:06:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:33,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:06:33,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:06:33,974 INFO L87 Difference]: Start difference. First operand 253 states and 281 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-02-06 12:06:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:34,481 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2025-02-06 12:06:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:06:34,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 58 [2025-02-06 12:06:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:34,483 INFO L225 Difference]: With dead ends: 260 [2025-02-06 12:06:34,483 INFO L226 Difference]: Without dead ends: 260 [2025-02-06 12:06:34,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:06:34,483 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 181 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:34,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 657 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:06:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-06 12:06:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2025-02-06 12:06:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.56) internal successors, (273), 247 states have internal predecessors, (273), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2025-02-06 12:06:34,488 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 58 [2025-02-06 12:06:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:34,488 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2025-02-06 12:06:34,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-02-06 12:06:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2025-02-06 12:06:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 12:06:34,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:34,489 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:34,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:06:34,489 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:34,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1977776377, now seen corresponding path program 1 times [2025-02-06 12:06:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:34,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482372721] [2025-02-06 12:06:34,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:34,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 12:06:34,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 12:06:34,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:34,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:34,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482372721] [2025-02-06 12:06:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482372721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:06:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98724990] [2025-02-06 12:06:34,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:34,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:06:34,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:06:34,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:06:34,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 12:06:34,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 12:06:34,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:34,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:34,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:06:34,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:06:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:34,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:06:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98724990] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:06:34,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:06:34,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:06:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804083360] [2025-02-06 12:06:34,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:06:34,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:06:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:34,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:06:34,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:06:34,985 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-02-06 12:06:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:35,010 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2025-02-06 12:06:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:35,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 62 [2025-02-06 12:06:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:35,012 INFO L225 Difference]: With dead ends: 282 [2025-02-06 12:06:35,012 INFO L226 Difference]: Without dead ends: 282 [2025-02-06 12:06:35,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:06:35,012 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 22 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:35,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 421 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:06:35,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-06 12:06:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 277. [2025-02-06 12:06:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 199 states have (on average 1.5427135678391959) internal successors, (307), 271 states have internal predecessors, (307), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:06:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 313 transitions. [2025-02-06 12:06:35,018 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 313 transitions. Word has length 62 [2025-02-06 12:06:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:35,018 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 313 transitions. [2025-02-06 12:06:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-02-06 12:06:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 313 transitions. [2025-02-06 12:06:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 12:06:35,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:35,019 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:35,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:06:35,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-06 12:06:35,224 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-02-06 12:06:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1181772249, now seen corresponding path program 1 times [2025-02-06 12:06:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340015645] [2025-02-06 12:06:35,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:35,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:06:35,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:06:35,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:35,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:35,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:35,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340015645] [2025-02-06 12:06:35,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340015645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:06:35,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170461785] [2025-02-06 12:06:35,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:35,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:35,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:06:35,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:06:35,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:06:35,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:06:36,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:06:36,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:36,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:36,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:06:36,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:06:36,105 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 10 treesize of output 8 [2025-02-06 12:06:36,143 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:06:36,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:06:36,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:06:36,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-06 12:06:36,320 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:06:36,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-06 12:06:36,400 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:06:36,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-06 12:06:36,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2025-02-06 12:06:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 12:06:36,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:06:36,575 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2610))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2611)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:06:36,582 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2610))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2611)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:06:36,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int)) (v_ArrVal_2609 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2609))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2610)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2611)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:06:36,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:06:36,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-02-06 12:06:36,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5374 treesize of output 4198 [2025-02-06 12:06:36,692 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 879 treesize of output 687 [2025-02-06 12:06:36,701 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 687 treesize of output 615 [2025-02-06 12:06:36,710 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 615 treesize of output 483 [2025-02-06 12:06:51,667 WARN L286 SmtUtils]: Spent 13.45s on a formula simplification that was a NOOP. DAG size: 2313 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-06 12:06:51,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:06:51,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 561 case distinctions, treesize of input 447 treesize of output 4867