./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 48c9605d 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-?-48c9605-m [2025-02-08 07:42:53,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:42:53,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:42:53,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:42:53,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:42:53,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:42:53,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:42:53,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:42:53,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:42:53,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:42:53,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:42:53,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:42:53,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:42:53,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:42:53,475 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:42:53,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:42:53,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:42:53,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:53,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:42:53,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:42:53,478 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-08 07:42:53,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:42:53,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:42:53,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:42:53,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:42:53,720 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:42:53,721 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-08 07:42:54,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7a4078a2/e08dcc881bfe4b1ca582b493bf84db55/FLAGc7837c7c0 [2025-02-08 07:42:55,247 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:42:55,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-3.i [2025-02-08 07:42:55,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7a4078a2/e08dcc881bfe4b1ca582b493bf84db55/FLAGc7837c7c0 [2025-02-08 07:42:55,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7a4078a2/e08dcc881bfe4b1ca582b493bf84db55 [2025-02-08 07:42:55,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:42:55,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:42:55,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:55,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:42:55,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:42:55,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:55" (1/1) ... [2025-02-08 07:42:55,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d6f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:55, skipping insertion in model container [2025-02-08 07:42:55,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:55" (1/1) ... [2025-02-08 07:42:55,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:42:56,147 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-08 07:42:56,149 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-08 07:42:56,150 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-08 07:42:56,151 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-08 07:42:56,152 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-08 07:42:56,152 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-08 07:42:56,153 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-08 07:42:56,153 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-08 07:42:56,154 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-08 07:42:56,155 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-08 07:42:56,156 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-08 07:42:56,159 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-08 07:42:56,159 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-08 07:42:56,165 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-08 07:42:56,170 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-08 07:42:56,176 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-08 07:42:56,182 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:56,187 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-08 07:42:56,193 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:56,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:56,220 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:42:56,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:56,448 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 07:42:56,454 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:42:56,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56 WrapperNode [2025-02-08 07:42:56,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:56,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:56,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:42:56,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:42:56,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,527 INFO L138 Inliner]: procedures = 633, calls = 577, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1043 [2025-02-08 07:42:56,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:56,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:42:56,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:42:56,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:42:56,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,552 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 07:42:56,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:42:56,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:42:56,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:42:56,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:42:56,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (1/1) ... [2025-02-08 07:42:56,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:56,615 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-08 07:42:56,617 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-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-02-08 07:42:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:42:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 07:42:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:42:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 07:42:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-08 07:42:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-08 07:42:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 07:42:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 07:42:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 07:42:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 07:42:56,854 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:42:56,856 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:42:57,202 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet187#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet187#1;assume -9223372036854775808 <= write_#t~nondet187#1 && write_#t~nondet187#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet187#1;havoc write_#t~nondet187#1; [2025-02-08 07:42:57,202 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496: assume !true; [2025-02-08 07:42:57,202 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 07:42:57,202 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: full_write_#t~ret103#1 := safe_write_#res#1;havoc safe_write_#t~ret104#1, safe_write_#t~mem105#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret103#1 && full_write_#t~ret103#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret103#1;havoc full_write_#t~ret103#1; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2505-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2481: assume full_write_~cc~0#1 < 0; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2481: assume !(full_write_~cc~0#1 < 0);full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2498: safe_write_#t~ret104#1 := write_#res#1;havoc write_#t~nondet187#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret104#1 && safe_write_#t~ret104#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret104#1;havoc safe_write_#t~ret104#1; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2499: assume safe_write_~n~0#1 < 0; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2499: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:42:57,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500: safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem105#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500-1: SUMMARY for call safe_write_#t~mem105#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: write_#res#1 := write_~ret~1#1; [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2461: bb_verror_msg_#t~ret96#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet102#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret96#1 && bb_verror_msg_#t~ret96#1 <= 2147483647;havoc bb_verror_msg_#t~ret96#1; [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret104#1, safe_write_#t~mem105#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: bb_verror_msg_#t~ret98#1 := full_write_#res#1;havoc full_write_#t~ret103#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret98#1 && bb_verror_msg_#t~ret98#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset;havoc bb_verror_msg_#t~ret98#1; [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-2: SUMMARY for call bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:57,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:57,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:57,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-1: assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret103#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 07:43:01,623 INFO L1324 $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-08 07:43:01,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: assume !(4 == __main_#t~mem124#1);havoc __main_#t~mem124#1; [2025-02-08 07:43:01,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: assume !!(4 == __main_#t~mem124#1);havoc __main_#t~mem124#1; [2025-02-08 07:43:01,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588-1: SUMMARY for call __main_#t~mem124#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:43:01,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:43:01,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:43:01,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2689: havoc nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1;__main_#t~ret123#1 := nanosleep_#res#1;havoc nanosleep_#t~nondet144#1, nanosleep_#t~nondet145#1, nanosleep_#t~nondet146#1, nanosleep_#t~mem147#1, nanosleep_#t~short148#1, nanosleep_#t~mem149#1, nanosleep_#t~short150#1, nanosleep_#t~mem151#1, nanosleep_#t~mem152#1, nanosleep_#t~nondet153#1, nanosleep_#t~mem154#1, nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1, nanosleep_~__requested_time#1.base, nanosleep_~__requested_time#1.offset, nanosleep_~__remaining#1.base, nanosleep_~__remaining#1.offset;havoc nanosleep_#in~__requested_time#1.base, nanosleep_#in~__requested_time#1.offset, nanosleep_#in~__remaining#1.base, nanosleep_#in~__remaining#1.offset;assume { :end_inline_nanosleep } true;assume -2147483648 <= __main_#t~ret123#1 && __main_#t~ret123#1 <= 2147483647;havoc __main_#t~ret123#1; [2025-02-08 07:43:01,867 INFO L? ?]: Removed 498 outVars from TransFormulas that were not future-live. [2025-02-08 07:43:01,867 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:43:01,899 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:43:01,899 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:43:01,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:43:01 BoogieIcfgContainer [2025-02-08 07:43:01,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:43:01,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:43:01,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:43:01,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:43:01,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:42:55" (1/3) ... [2025-02-08 07:43:01,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1246c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:43:01, skipping insertion in model container [2025-02-08 07:43:01,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:56" (2/3) ... [2025-02-08 07:43:01,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1246c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:43:01, skipping insertion in model container [2025-02-08 07:43:01,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:43:01" (3/3) ... [2025-02-08 07:43:01,908 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-3.i [2025-02-08 07:43:01,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:43:01,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-3.i that has 6 procedures, 478 locations, 1 initial locations, 14 loop locations, and 211 error locations. [2025-02-08 07:43:01,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:43:01,971 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;@35368bb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:43:01,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 211 error locations. [2025-02-08 07:43:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 478 states, 247 states have (on average 2.02834008097166) internal successors, (501), 461 states have internal predecessors, (501), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 07:43:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:43:01,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:01,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:43:01,980 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-08 07:43:01,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash 15935, now seen corresponding path program 1 times [2025-02-08 07:43:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641784402] [2025-02-08 07:43:01,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:01,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:02,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:43:02,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:43:02,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:02,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:02,827 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-08 07:43:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641784402] [2025-02-08 07:43:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641784402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:43:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793911861] [2025-02-08 07:43:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:02,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:43:02,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:02,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:43:02,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:02,872 INFO L87 Difference]: Start difference. First operand has 478 states, 247 states have (on average 2.02834008097166) internal successors, (501), 461 states have internal predecessors, (501), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 07:43:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:03,099 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2025-02-08 07:43:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:43:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:03,108 INFO L225 Difference]: With dead ends: 209 [2025-02-08 07:43:03,109 INFO L226 Difference]: Without dead ends: 201 [2025-02-08 07:43:03,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-08 07:43:03,116 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 102 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:03,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 236 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:43:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-08 07:43:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-08 07:43:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 196 states have internal predecessors, (210), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 216 transitions. [2025-02-08 07:43:03,181 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 216 transitions. Word has length 2 [2025-02-08 07:43:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:03,181 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 216 transitions. [2025-02-08 07:43:03,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 07:43:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 216 transitions. [2025-02-08 07:43:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:43:03,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:03,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:43:03,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:43:03,182 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-08 07:43:03,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 15936, now seen corresponding path program 1 times [2025-02-08 07:43:03,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:03,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741828688] [2025-02-08 07:43:03,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:03,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:43:03,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:43:03,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:03,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:03,667 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-08 07:43:03,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:03,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741828688] [2025-02-08 07:43:03,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741828688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:03,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:03,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:43:03,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445522673] [2025-02-08 07:43:03,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:03,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:43:03,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:03,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:43:03,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:03,670 INFO L87 Difference]: Start difference. First operand 201 states and 216 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 07:43:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:03,861 INFO L93 Difference]: Finished difference Result 200 states and 215 transitions. [2025-02-08 07:43:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:03,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:43:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:03,862 INFO L225 Difference]: With dead ends: 200 [2025-02-08 07:43:03,862 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 07:43:03,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-08 07:43:03,863 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:03,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 320 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:43:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 07:43:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 07:43:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 195 states have internal predecessors, (209), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 215 transitions. [2025-02-08 07:43:03,869 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 215 transitions. Word has length 2 [2025-02-08 07:43:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:03,870 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 215 transitions. [2025-02-08 07:43:03,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-08 07:43:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 215 transitions. [2025-02-08 07:43:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:43:03,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:03,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:43:03,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:43:03,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-08 07:43:03,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash 475150352, now seen corresponding path program 1 times [2025-02-08 07:43:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:03,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483071781] [2025-02-08 07:43:03,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:04,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:43:04,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:43:04,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:04,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:04,123 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-08 07:43:04,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483071781] [2025-02-08 07:43:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483071781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:04,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:04,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:43:04,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630798812] [2025-02-08 07:43:04,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:04,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:43:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:04,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:43:04,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:04,125 INFO L87 Difference]: Start difference. First operand 200 states and 215 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-08 07:43:08,149 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-08 07:43:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:08,172 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2025-02-08 07:43:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:08,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-08 07:43:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:08,174 INFO L225 Difference]: With dead ends: 203 [2025-02-08 07:43:08,174 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 07:43:08,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:08,174 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:08,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 419 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 07:43:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 07:43:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2025-02-08 07:43:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 109 states have (on average 1.926605504587156) internal successors, (210), 196 states have internal predecessors, (210), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 216 transitions. [2025-02-08 07:43:08,190 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 216 transitions. Word has length 5 [2025-02-08 07:43:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:08,190 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 216 transitions. [2025-02-08 07:43:08,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-08 07:43:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 216 transitions. [2025-02-08 07:43:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:43:08,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:08,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:43:08,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:43:08,191 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-08 07:43:08,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash 475150513, now seen corresponding path program 1 times [2025-02-08 07:43:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385658716] [2025-02-08 07:43:08,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:08,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:43:08,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:43:08,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:08,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:08,582 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-08 07:43:08,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:08,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385658716] [2025-02-08 07:43:08,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385658716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:08,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:08,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:43:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727842463] [2025-02-08 07:43:08,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:08,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:43:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:08,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:43:08,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:43:08,584 INFO L87 Difference]: Start difference. First operand 201 states and 216 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 07:43:12,601 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-08 07:43:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:12,740 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2025-02-08 07:43:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:43:12,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-02-08 07:43:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:12,741 INFO L225 Difference]: With dead ends: 203 [2025-02-08 07:43:12,741 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 07:43:12,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:43:12,742 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 105 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:12,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 428 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 07:43:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 07:43:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2025-02-08 07:43:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 110 states have (on average 1.9181818181818182) internal successors, (211), 197 states have internal predecessors, (211), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2025-02-08 07:43:12,747 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 5 [2025-02-08 07:43:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:12,748 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2025-02-08 07:43:12,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 07:43:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2025-02-08 07:43:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:43:12,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:12,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:12,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:43:12,748 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-08 07:43:12,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1002878662, now seen corresponding path program 1 times [2025-02-08 07:43:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:12,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833038846] [2025-02-08 07:43:12,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:12,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:43:12,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:43:12,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:12,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833038846] [2025-02-08 07:43:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833038846] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38392643] [2025-02-08 07:43:13,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:13,019 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-08 07:43:13,028 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-08 07:43:13,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:43:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:43:13,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:13,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:13,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:43:13,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:13,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:13,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38392643] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:13,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:13,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:43:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345780487] [2025-02-08 07:43:13,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:13,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:43:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:13,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:43:13,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:13,466 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-08 07:43:17,482 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-08 07:43:21,488 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-08 07:43:25,494 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-08 07:43:29,506 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-08 07:43:33,520 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-08 07:43:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:33,551 INFO L93 Difference]: Finished difference Result 210 states and 227 transitions. [2025-02-08 07:43:33,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:43:33,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 8 [2025-02-08 07:43:33,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:33,552 INFO L225 Difference]: With dead ends: 210 [2025-02-08 07:43:33,552 INFO L226 Difference]: Without dead ends: 210 [2025-02-08 07:43:33,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:33,553 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:33,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 627 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-02-08 07:43:33,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-08 07:43:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-02-08 07:43:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 118 states have (on average 1.8728813559322033) internal successors, (221), 205 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2025-02-08 07:43:33,559 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 8 [2025-02-08 07:43:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:33,559 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2025-02-08 07:43:33,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-08 07:43:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2025-02-08 07:43:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:43:33,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:33,560 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:33,570 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-08 07:43:33,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:33,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-08 07:43:33,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:33,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1002878501, now seen corresponding path program 1 times [2025-02-08 07:43:33,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:33,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738359777] [2025-02-08 07:43:33,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:33,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:33,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:43:33,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:43:33,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:33,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:34,157 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-08 07:43:34,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738359777] [2025-02-08 07:43:34,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738359777] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747556243] [2025-02-08 07:43:34,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:34,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:34,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:34,160 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-08 07:43:34,161 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-08 07:43:34,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:43:34,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:43:34,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:34,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:34,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:43:34,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:34,685 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-08 07:43:34,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:34,781 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-08 07:43:34,793 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-08 07:43:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747556243] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:34,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:34,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:43:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971221377] [2025-02-08 07:43:34,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:34,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:43:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:34,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:43:34,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:43:34,796 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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-08 07:43:38,815 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-08 07:43:42,824 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-08 07:43:46,830 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-08 07:43:50,833 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-08 07:43:54,848 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-08 07:43:58,852 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-08 07:43:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:59,246 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2025-02-08 07:43:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:43:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 8 [2025-02-08 07:43:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:59,247 INFO L225 Difference]: With dead ends: 209 [2025-02-08 07:43:59,247 INFO L226 Difference]: Without dead ends: 209 [2025-02-08 07:43:59,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:43:59,248 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 225 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:59,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 704 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 359 Invalid, 6 Unknown, 0 Unchecked, 24.4s Time] [2025-02-08 07:43:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-08 07:43:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-08 07:43:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 118 states have (on average 1.847457627118644) internal successors, (218), 204 states have internal predecessors, (218), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 224 transitions. [2025-02-08 07:43:59,252 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 224 transitions. Word has length 8 [2025-02-08 07:43:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:59,252 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 224 transitions. [2025-02-08 07:43:59,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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-08 07:43:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 224 transitions. [2025-02-08 07:43:59,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:43:59,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:59,253 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:43:59,261 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-08 07:43:59,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:59,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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-08 07:43:59,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash -576432240, now seen corresponding path program 2 times [2025-02-08 07:43:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127981514] [2025-02-08 07:43:59,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:43:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:59,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 07:43:59,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-02-08 07:43:59,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:43:59,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 07:43:59,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:59,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127981514] [2025-02-08 07:43:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127981514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:59,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:59,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:43:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289100732] [2025-02-08 07:43:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:59,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:43:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:59,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:43:59,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:43:59,837 INFO L87 Difference]: Start difference. First operand 209 states and 224 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-08 07:43:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:59,984 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2025-02-08 07:43:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:43:59,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 17 [2025-02-08 07:43:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:59,985 INFO L225 Difference]: With dead ends: 208 [2025-02-08 07:43:59,985 INFO L226 Difference]: Without dead ends: 208 [2025-02-08 07:43:59,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:43:59,985 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 289 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:59,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 178 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:43:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-08 07:43:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-02-08 07:43:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 118 states have (on average 1.8389830508474576) internal successors, (217), 203 states have internal predecessors, (217), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2025-02-08 07:43:59,989 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 17 [2025-02-08 07:43:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:59,989 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2025-02-08 07:43:59,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-08 07:43:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2025-02-08 07:43:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:43:59,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:59,990 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:43:59,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:43:59,990 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-08 07:43:59,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash -576432239, now seen corresponding path program 1 times [2025-02-08 07:43:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:59,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845955059] [2025-02-08 07:43:59,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:00,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:44:00,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:44:00,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:00,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:00,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845955059] [2025-02-08 07:44:00,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845955059] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329244242] [2025-02-08 07:44:00,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:00,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:00,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:00,320 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-08 07:44:00,321 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-08 07:44:00,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:44:00,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:44:00,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:00,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:00,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:44:00,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:00,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329244242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:00,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:00,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:44:00,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107209529] [2025-02-08 07:44:00,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:00,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:44:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:00,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:44:00,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:44:00,843 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-08 07:44:04,858 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-08 07:44:08,868 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-08 07:44:12,879 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-08 07:44:16,881 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-08 07:44:20,892 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-08 07:44:24,906 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-08 07:44:28,925 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-08 07:44:32,928 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-08 07:44:36,935 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 []