./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/sleep-3.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/sleep-3.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 9c7796745953b6206348345fcef2fe39b8cd94bc666f8f6dde12d2e156216f8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:05:05,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:05:05,284 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:05:05,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:05:05,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:05:05,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:05:05,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:05:05,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:05:05,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:05:05,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:05:05,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:05:05,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:05:05,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:05:05,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:05:05,320 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:05:05,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:05:05,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:05:05,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:05:05,321 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:05:05,321 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:05:05,321 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:05:05,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:05:05,321 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:05:05,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:05:05,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:05:05,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:05:05,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:05:05,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:05:05,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:05:05,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:05:05,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:05:05,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:05:05,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:05:05,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:05:05,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:05:05,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:05:05,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:05:05,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:05:05,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:05:05,324 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 -> 9c7796745953b6206348345fcef2fe39b8cd94bc666f8f6dde12d2e156216f8e [2025-02-06 12:05:05,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:05:05,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:05:05,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:05:05,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:05:05,617 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:05:05,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/sleep-3.i [2025-02-06 12:05:07,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/149bc1bdf/6f7b8c96cd344fdb8196063d65f00f47/FLAGff438854b [2025-02-06 12:05:08,101 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:05:08,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-3.i [2025-02-06 12:05:08,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/149bc1bdf/6f7b8c96cd344fdb8196063d65f00f47/FLAGff438854b [2025-02-06 12:05:08,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/149bc1bdf/6f7b8c96cd344fdb8196063d65f00f47 [2025-02-06 12:05:08,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:05:08,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:05:08,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:05:08,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:05:08,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:05:08,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:05:08" (1/1) ... [2025-02-06 12:05:08,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3388af4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:08, skipping insertion in model container [2025-02-06 12:05:08,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:05:08" (1/1) ... [2025-02-06 12:05:08,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:05:09,437 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:05:09,443 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:05:09,448 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:05:09,453 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:05:09,454 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:05:09,456 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:05:09,457 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:05:09,457 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:05:09,458 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:05:09,464 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:05:09,466 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:05:09,481 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:05:09,482 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:05:09,495 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:05:09,499 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:05:09,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:05:09,519 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:05:09,537 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:05:09,551 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:05:09,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:05:09,601 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:05:09,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:05:09,944 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 12:05:09,951 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:05:09,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09 WrapperNode [2025-02-06 12:05:09,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:05:09,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:05:09,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:05:09,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:05:09,957 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:05:09" (1/1) ... [2025-02-06 12:05:09,994 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:05:09" (1/1) ... [2025-02-06 12:05:10,061 INFO L138 Inliner]: procedures = 633, calls = 577, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1043 [2025-02-06 12:05:10,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:05:10,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:05:10,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:05:10,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:05:10,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,112 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 12:05:10,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:05:10,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:05:10,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:05:10,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:05:10,220 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (1/1) ... [2025-02-06 12:05:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:05:10,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:10,248 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:05:10,250 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:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-02-06 12:05:10,266 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:05:10,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:05:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 12:05:10,267 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:05:10,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-06 12:05:10,267 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 12:05:10,267 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 12:05:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 12:05:10,640 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:05:10,642 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:05:15,721 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: call ULTIMATE.dealloc(__main_~#ts~0#1.base, __main_~#ts~0#1.offset);havoc __main_~#ts~0#1.base, __main_~#ts~0#1.offset; [2025-02-06 12:05:15,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2689: havoc nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1; [2025-02-06 12:05:15,977 INFO L? ?]: Removed 538 outVars from TransFormulas that were not future-live. [2025-02-06 12:05:15,977 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:05:16,019 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:05:16,020 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:05:16,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:05:16 BoogieIcfgContainer [2025-02-06 12:05:16,020 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:05:16,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:05:16,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:05:16,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:05:16,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:05:08" (1/3) ... [2025-02-06 12:05:16,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5688f17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:05:16, skipping insertion in model container [2025-02-06 12:05:16,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:05:09" (2/3) ... [2025-02-06 12:05:16,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5688f17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:05:16, skipping insertion in model container [2025-02-06 12:05:16,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:05:16" (3/3) ... [2025-02-06 12:05:16,034 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-3.i [2025-02-06 12:05:16,047 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:05:16,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-3.i that has 6 procedures, 505 locations, 1 initial locations, 14 loop locations, and 211 error locations. [2025-02-06 12:05:16,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:05:16,110 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;@5eecae74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:05:16,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 211 error locations. [2025-02-06 12:05:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 505 states, 274 states have (on average 1.9744525547445255) internal successors, (541), 487 states have internal predecessors, (541), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 12:05:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:05:16,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:16,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:05:16,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:05:16,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash 500439, now seen corresponding path program 1 times [2025-02-06 12:05:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:16,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655208952] [2025-02-06 12:05:16,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:16,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:05:16,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:05:16,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:17,096 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:05:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:17,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655208952] [2025-02-06 12:05:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655208952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:17,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:17,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:05:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070075064] [2025-02-06 12:05:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:17,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:05:17,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:17,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:05:17,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:05:17,131 INFO L87 Difference]: Start difference. First operand has 505 states, 274 states have (on average 1.9744525547445255) internal successors, (541), 487 states have internal predecessors, (541), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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:05:21,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:21,534 INFO L93 Difference]: Finished difference Result 391 states and 427 transitions. [2025-02-06 12:05:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:05:21,539 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:05:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:21,549 INFO L225 Difference]: With dead ends: 391 [2025-02-06 12:05:21,549 INFO L226 Difference]: Without dead ends: 385 [2025-02-06 12:05:21,550 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:05:21,553 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 102 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:21,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 492 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 12:05:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-06 12:05:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 332. [2025-02-06 12:05:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 178 states have (on average 1.949438202247191) internal successors, (347), 322 states have internal predecessors, (347), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 361 transitions. [2025-02-06 12:05:21,635 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 361 transitions. Word has length 3 [2025-02-06 12:05:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:21,636 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 361 transitions. [2025-02-06 12:05:21,636 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:05:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 361 transitions. [2025-02-06 12:05:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:05:21,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:21,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:05:21,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:05:21,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:05:21,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash 500440, now seen corresponding path program 1 times [2025-02-06 12:05:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:21,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568304716] [2025-02-06 12:05:21,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:21,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:05:21,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:05:21,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:21,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:22,215 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:05:22,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568304716] [2025-02-06 12:05:22,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568304716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:22,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:22,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:05:22,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063941872] [2025-02-06 12:05:22,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:22,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:05:22,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:22,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:05:22,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:05:22,218 INFO L87 Difference]: Start difference. First operand 332 states and 361 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:05:26,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:26,507 INFO L93 Difference]: Finished difference Result 331 states and 360 transitions. [2025-02-06 12:05:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:05:26,507 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:05:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:26,509 INFO L225 Difference]: With dead ends: 331 [2025-02-06 12:05:26,509 INFO L226 Difference]: Without dead ends: 331 [2025-02-06 12:05:26,509 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:05:26,510 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:26,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 560 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 12:05:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-02-06 12:05:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2025-02-06 12:05:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 178 states have (on average 1.9438202247191012) internal successors, (346), 321 states have internal predecessors, (346), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 360 transitions. [2025-02-06 12:05:26,531 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 360 transitions. Word has length 3 [2025-02-06 12:05:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:26,531 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 360 transitions. [2025-02-06 12:05:26,531 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:05:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 360 transitions. [2025-02-06 12:05:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:05:26,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:26,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:05:26,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:05:26,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:05:26,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:26,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2024112254, now seen corresponding path program 1 times [2025-02-06 12:05:26,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:26,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145278183] [2025-02-06 12:05:26,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:26,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:26,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:05:26,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:05:26,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:26,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:27,170 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:05:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:27,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145278183] [2025-02-06 12:05:27,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145278183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:27,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:27,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:05:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032735473] [2025-02-06 12:05:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:27,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:05:27,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:27,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:05:27,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:05:27,173 INFO L87 Difference]: Start difference. First operand 331 states and 360 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:05:31,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:35,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:35,541 INFO L93 Difference]: Finished difference Result 334 states and 363 transitions. [2025-02-06 12:05:35,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:05:35,542 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:05:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:35,543 INFO L225 Difference]: With dead ends: 334 [2025-02-06 12:05:35,543 INFO L226 Difference]: Without dead ends: 334 [2025-02-06 12:05:35,544 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:05:35,544 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 10 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:35,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 767 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-06 12:05:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-06 12:05:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2025-02-06 12:05:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 180 states have (on average 1.9333333333333333) internal successors, (348), 323 states have internal predecessors, (348), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 362 transitions. [2025-02-06 12:05:35,558 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 362 transitions. Word has length 6 [2025-02-06 12:05:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:35,559 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 362 transitions. [2025-02-06 12:05:35,559 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:05:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 362 transitions. [2025-02-06 12:05:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:05:35,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:35,559 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:35,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:05:35,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:05:35,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1012275629, now seen corresponding path program 1 times [2025-02-06 12:05:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041842806] [2025-02-06 12:05:35,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:35,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:05:35,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:05:35,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:35,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:36,237 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:05:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041842806] [2025-02-06 12:05:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041842806] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:36,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539701359] [2025-02-06 12:05:36,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:36,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:36,241 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:05:36,243 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:05:36,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:05:36,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:05:36,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:36,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:36,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:05:36,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:36,861 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:05:36,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:36,964 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:05:36,981 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:05:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539701359] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:36,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:36,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:05:36,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709762152] [2025-02-06 12:05:36,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:36,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:05:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:36,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:05:36,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:05:36,983 INFO L87 Difference]: Start difference. First operand 333 states and 362 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:05:41,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:45,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:49,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:53,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:57,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:01,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:05,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:09,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:13,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:17,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:18,004 INFO L93 Difference]: Finished difference Result 337 states and 366 transitions. [2025-02-06 12:06:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:06:18,005 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:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:18,007 INFO L225 Difference]: With dead ends: 337 [2025-02-06 12:06:18,007 INFO L226 Difference]: Without dead ends: 337 [2025-02-06 12:06:18,009 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:18,012 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 441 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 13 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:18,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1499 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 783 Invalid, 10 Unknown, 0 Unchecked, 40.9s Time] [2025-02-06 12:06:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-06 12:06:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-02-06 12:06:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 185 states have (on average 1.9027027027027028) internal successors, (352), 327 states have internal predecessors, (352), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 366 transitions. [2025-02-06 12:06:18,036 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 366 transitions. Word has length 9 [2025-02-06 12:06:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:18,036 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 366 transitions. [2025-02-06 12:06:18,036 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:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 366 transitions. [2025-02-06 12:06:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 12:06:18,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:18,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:18,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:06:18,241 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:18,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:06:18,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1768170962, now seen corresponding path program 1 times [2025-02-06 12:06:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289843637] [2025-02-06 12:06:18,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:18,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:06:18,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:06:18,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:18,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:18,793 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:18,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289843637] [2025-02-06 12:06:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289843637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:06:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696588242] [2025-02-06 12:06:18,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:18,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:18,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:06:18,797 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:18,799 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:19,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:06:19,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:06:19,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:19,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:19,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:06:19,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:06:19,372 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:19,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:06:19,453 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:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696588242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:06:19,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:06:19,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 12:06:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167213935] [2025-02-06 12:06:19,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:06:19,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:06:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:19,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:06:19,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:06:19,455 INFO L87 Difference]: Start difference. First operand 337 states and 366 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:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:19,542 INFO L93 Difference]: Finished difference Result 352 states and 381 transitions. [2025-02-06 12:06:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:06:19,542 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:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:19,544 INFO L225 Difference]: With dead ends: 352 [2025-02-06 12:06:19,544 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 12:06:19,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:06:19,546 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 4 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:19,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1768 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 12:06:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-02-06 12:06:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 200 states have (on average 1.835) internal successors, (367), 342 states have internal predecessors, (367), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2025-02-06 12:06:19,558 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 15 [2025-02-06 12:06:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:19,558 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2025-02-06 12:06:19,559 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:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2025-02-06 12:06:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:06:19,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:19,560 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:19,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:06:19,764 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:19,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:06:19,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:19,766 INFO L85 PathProgramCache]: Analyzing trace with hash 659677021, now seen corresponding path program 2 times [2025-02-06 12:06:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:19,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486400723] [2025-02-06 12:06:19,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:06:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:20,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:06:20,033 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:20,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:06:20,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:20,329 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:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:20,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486400723] [2025-02-06 12:06:20,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486400723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:20,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:20,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:06:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16682884] [2025-02-06 12:06:20,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:20,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:06:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:20,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:06:20,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:20,331 INFO L87 Difference]: Start difference. First operand 352 states and 381 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:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:20,841 INFO L93 Difference]: Finished difference Result 502 states and 548 transitions. [2025-02-06 12:06:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:20,842 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:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:20,844 INFO L225 Difference]: With dead ends: 502 [2025-02-06 12:06:20,844 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 12:06:20,844 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:20,845 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 598 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:20,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 618 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:06:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 12:06:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 355. [2025-02-06 12:06:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 203 states have (on average 1.8177339901477831) internal successors, (369), 344 states have internal predecessors, (369), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 383 transitions. [2025-02-06 12:06:20,856 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 383 transitions. Word has length 30 [2025-02-06 12:06:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:20,856 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 383 transitions. [2025-02-06 12:06:20,856 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:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 383 transitions. [2025-02-06 12:06:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:06:20,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:20,857 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:20,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:06:20,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:06:20,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:20,858 INFO L85 PathProgramCache]: Analyzing trace with hash 659677022, now seen corresponding path program 1 times [2025-02-06 12:06:20,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:20,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011996483] [2025-02-06 12:06:20,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:20,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:21,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:06:21,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:06:21,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:21,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:21,502 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:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:21,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011996483] [2025-02-06 12:06:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011996483] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:06:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146793160] [2025-02-06 12:06:21,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:21,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:06:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:06:21,509 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:21,511 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:21,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:06:22,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:06:22,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:22,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:22,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:06:22,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:06:22,167 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:22,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:06:22,294 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:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146793160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:06:22,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:06:22,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-06 12:06:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100552596] [2025-02-06 12:06:22,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:06:22,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:06:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:22,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:06:22,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:06:22,297 INFO L87 Difference]: Start difference. First operand 355 states and 383 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:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:22,376 INFO L93 Difference]: Finished difference Result 361 states and 389 transitions. [2025-02-06 12:06:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:06:22,376 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:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:22,378 INFO L225 Difference]: With dead ends: 361 [2025-02-06 12:06:22,378 INFO L226 Difference]: Without dead ends: 361 [2025-02-06 12:06:22,379 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:22,379 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 2 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:22,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1059 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-06 12:06:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-02-06 12:06:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 209 states have (on average 1.7942583732057416) internal successors, (375), 350 states have internal predecessors, (375), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 389 transitions. [2025-02-06 12:06:22,388 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 389 transitions. Word has length 30 [2025-02-06 12:06:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:22,389 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 389 transitions. [2025-02-06 12:06:22,389 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:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 389 transitions. [2025-02-06 12:06:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:06:22,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:22,390 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:22,402 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:22,594 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:22,594 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:06:22,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2033644350, now seen corresponding path program 2 times [2025-02-06 12:06:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94762589] [2025-02-06 12:06:22,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:06:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:22,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:06:22,799 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:22,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:06:22,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:23,203 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:23,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:23,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94762589] [2025-02-06 12:06:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94762589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:06:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421569532] [2025-02-06 12:06:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:23,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:06:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:23,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:06:23,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:06:23,205 INFO L87 Difference]: Start difference. First operand 361 states and 389 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:27,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:28,148 INFO L93 Difference]: Finished difference Result 652 states and 707 transitions. [2025-02-06 12:06:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:28,148 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:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:28,151 INFO L225 Difference]: With dead ends: 652 [2025-02-06 12:06:28,151 INFO L226 Difference]: Without dead ends: 652 [2025-02-06 12:06:28,152 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:28,153 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 442 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:28,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 636 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 649 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-02-06 12:06:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-06 12:06:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 360. [2025-02-06 12:06:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 209 states have (on average 1.7894736842105263) internal successors, (374), 349 states have internal predecessors, (374), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 388 transitions. [2025-02-06 12:06:28,168 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 388 transitions. Word has length 36 [2025-02-06 12:06:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:28,170 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 388 transitions. [2025-02-06 12:06:28,171 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:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 388 transitions. [2025-02-06 12:06:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:06:28,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:28,172 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:28,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:06:28,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:06:28,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2101235275, now seen corresponding path program 1 times [2025-02-06 12:06:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:28,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480152395] [2025-02-06 12:06:28,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:28,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:06:28,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:06:28,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:28,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:28,800 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,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480152395] [2025-02-06 12:06:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480152395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:28,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:28,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:06:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167413331] [2025-02-06 12:06:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:28,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:06:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:28,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:06:28,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:28,805 INFO L87 Difference]: Start difference. First operand 360 states and 388 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:32,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:33,113 INFO L93 Difference]: Finished difference Result 408 states and 441 transitions. [2025-02-06 12:06:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:33,114 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:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:33,116 INFO L225 Difference]: With dead ends: 408 [2025-02-06 12:06:33,116 INFO L226 Difference]: Without dead ends: 408 [2025-02-06 12:06:33,116 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:33,117 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 80 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 490 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 12:06:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-06 12:06:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 355. [2025-02-06 12:06:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 209 states have (on average 1.7655502392344498) internal successors, (369), 344 states have internal predecessors, (369), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 383 transitions. [2025-02-06 12:06:33,127 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 383 transitions. Word has length 44 [2025-02-06 12:06:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:33,127 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 383 transitions. [2025-02-06 12:06:33,127 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:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 383 transitions. [2025-02-06 12:06:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:06:33,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:33,130 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:33,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:06:33,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:06:33,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2101235276, now seen corresponding path program 1 times [2025-02-06 12:06:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521309685] [2025-02-06 12:06:33,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:06:33,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:06:33,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:33,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:34,204 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:34,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521309685] [2025-02-06 12:06:34,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521309685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:34,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:34,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:06:34,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252998354] [2025-02-06 12:06:34,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:34,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:06:34,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:34,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:06:34,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:34,206 INFO L87 Difference]: Start difference. First operand 355 states and 383 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:34,468 INFO L93 Difference]: Finished difference Result 355 states and 384 transitions. [2025-02-06 12:06:34,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:34,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:34,471 INFO L225 Difference]: With dead ends: 355 [2025-02-06 12:06:34,471 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 12:06:34,471 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:34,472 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 194 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:34,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1261 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:06:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 12:06:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 354. [2025-02-06 12:06:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 209 states have (on average 1.7607655502392345) internal successors, (368), 343 states have internal predecessors, (368), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 382 transitions. [2025-02-06 12:06:34,482 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 382 transitions. Word has length 44 [2025-02-06 12:06:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:34,482 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 382 transitions. [2025-02-06 12:06:34,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 382 transitions. [2025-02-06 12:06:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:06:34,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:34,485 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:34,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:06:34,485 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-02-06 12:06:34,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1247841670, now seen corresponding path program 1 times [2025-02-06 12:06:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518698534] [2025-02-06 12:06:34,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:34,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:06:34,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:06:34,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:34,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:35,147 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:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518698534] [2025-02-06 12:06:35,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518698534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:35,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:35,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:06:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041980062] [2025-02-06 12:06:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:35,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:06:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:35,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:06:35,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:35,149 INFO L87 Difference]: Start difference. First operand 354 states and 382 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)