./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/sleep-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/sleep-1.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 d0bc799b191b0f041501848e0b025f1bbbbae14bfc340caf1bcdba3dca73f41a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:04:42,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:04:42,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:04:42,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:04:42,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:04:42,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:04:42,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:04:42,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:04:42,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:04:42,450 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:04:42,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:04:42,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:04:42,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:04:42,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:04:42,451 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:04:42,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:04:42,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:04:42,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:04:42,451 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:04:42,451 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:04:42,451 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:04:42,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:04:42,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:04:42,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:04:42,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:04:42,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:04:42,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:04:42,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:04:42,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:04:42,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:04:42,453 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 -> d0bc799b191b0f041501848e0b025f1bbbbae14bfc340caf1bcdba3dca73f41a [2025-02-06 12:04:42,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:04:42,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:04:42,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:04:42,705 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:04:42,705 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:04:42,706 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-1.i [2025-02-06 12:04:44,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c293c45bb/23aac8a9deb44925a15392c2d9a3f308/FLAGcb4d18b25 [2025-02-06 12:04:44,588 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:04:44,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-1.i [2025-02-06 12:04:44,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c293c45bb/23aac8a9deb44925a15392c2d9a3f308/FLAGcb4d18b25 [2025-02-06 12:04:45,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c293c45bb/23aac8a9deb44925a15392c2d9a3f308 [2025-02-06 12:04:45,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:04:45,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:04:45,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:04:45,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:04:45,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:04:45,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:45" (1/1) ... [2025-02-06 12:04:45,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:45, skipping insertion in model container [2025-02-06 12:04:45,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:45" (1/1) ... [2025-02-06 12:04:45,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:04:45,851 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,857 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,859 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,861 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,862 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,863 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,864 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,864 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,868 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,869 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,870 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,876 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,877 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,888 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,890 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,898 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,911 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,922 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,934 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:45,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:04:45,975 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:04:46,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:04:46,238 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 12:04:46,247 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:04:46,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46 WrapperNode [2025-02-06 12:04:46,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:04:46,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:04:46,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:04:46,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:04:46,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,404 INFO L138 Inliner]: procedures = 633, calls = 576, calls flagged for inlining = 18, calls inlined = 16, statements flattened = 1040 [2025-02-06 12:04:46,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:04:46,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:04:46,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:04:46,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:04:46,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,442 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 12:04:46,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:04:46,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:04:46,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:04:46,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:04:46,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (1/1) ... [2025-02-06 12:04:46,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:04:46,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:46,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:04:46,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:04:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:04:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 12:04:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-02-06 12:04:46,557 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-02-06 12:04:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 12:04:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 12:04:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:04:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:04:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:04:46,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 12:04:46,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:04:46,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 12:04:46,559 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 12:04:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 12:04:46,887 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:04:46,888 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:04:51,818 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: call ULTIMATE.dealloc(__main_~#ts~0#1.base, __main_~#ts~0#1.offset);havoc __main_~#ts~0#1.base, __main_~#ts~0#1.offset; [2025-02-06 12:04:51,822 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2689: havoc nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1; [2025-02-06 12:04:52,011 INFO L? ?]: Removed 531 outVars from TransFormulas that were not future-live. [2025-02-06 12:04:52,011 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:04:52,041 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:04:52,041 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:04:52,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:52 BoogieIcfgContainer [2025-02-06 12:04:52,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:04:52,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:04:52,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:04:52,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:04:52,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:04:45" (1/3) ... [2025-02-06 12:04:52,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3febeba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:52, skipping insertion in model container [2025-02-06 12:04:52,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:46" (2/3) ... [2025-02-06 12:04:52,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3febeba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:52, skipping insertion in model container [2025-02-06 12:04:52,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:52" (3/3) ... [2025-02-06 12:04:52,049 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-1.i [2025-02-06 12:04:52,058 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:04:52,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-1.i that has 5 procedures, 494 locations, 1 initial locations, 14 loop locations, and 209 error locations. [2025-02-06 12:04:52,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:04:52,098 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;@12b91764, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:04:52,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 209 error locations. [2025-02-06 12:04:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 494 states, 268 states have (on average 1.9850746268656716) internal successors, (532), 477 states have internal predecessors, (532), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 12:04:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:52,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:52,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:52,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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 206 more)] === [2025-02-06 12:04:52,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash 492496, now seen corresponding path program 1 times [2025-02-06 12:04:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:52,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934548929] [2025-02-06 12:04:52,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:52,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:52,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:52,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:52,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934548929] [2025-02-06 12:04:53,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934548929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:53,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:53,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:53,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138271246] [2025-02-06 12:04:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:53,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:53,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:53,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:53,030 INFO L87 Difference]: Start difference. First operand has 494 states, 268 states have (on average 1.9850746268656716) internal successors, (532), 477 states have internal predecessors, (532), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:57,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:04:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:57,554 INFO L93 Difference]: Finished difference Result 329 states and 359 transitions. [2025-02-06 12:04:57,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:57,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:04:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:57,563 INFO L225 Difference]: With dead ends: 329 [2025-02-06 12:04:57,563 INFO L226 Difference]: Without dead ends: 327 [2025-02-06 12:04:57,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:57,566 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 10 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:57,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 555 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 12:04:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-06 12:04:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-02-06 12:04:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 174 states have (on average 1.971264367816092) internal successors, (343), 317 states have internal predecessors, (343), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:04:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 357 transitions. [2025-02-06 12:04:57,608 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 357 transitions. Word has length 3 [2025-02-06 12:04:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:57,609 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 357 transitions. [2025-02-06 12:04:57,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 357 transitions. [2025-02-06 12:04:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:57,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:57,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:57,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:04:57,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:04:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash 492495, now seen corresponding path program 1 times [2025-02-06 12:04:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:57,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870829552] [2025-02-06 12:04:57,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:57,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:57,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:57,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:57,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:57,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870829552] [2025-02-06 12:04:58,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870829552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449452148] [2025-02-06 12:04:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:58,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:58,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:58,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:58,139 INFO L87 Difference]: Start difference. First operand 327 states and 357 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:02,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:02,531 INFO L93 Difference]: Finished difference Result 373 states and 408 transitions. [2025-02-06 12:05:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:05:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:05:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:02,538 INFO L225 Difference]: With dead ends: 373 [2025-02-06 12:05:02,538 INFO L226 Difference]: Without dead ends: 373 [2025-02-06 12:05:02,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:05:02,539 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 94 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:02,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 475 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-06 12:05:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-06 12:05:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 325. [2025-02-06 12:05:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 174 states have (on average 1.9597701149425288) internal successors, (341), 315 states have internal predecessors, (341), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 355 transitions. [2025-02-06 12:05:02,589 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 355 transitions. Word has length 3 [2025-02-06 12:05:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 355 transitions. [2025-02-06 12:05:02,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 355 transitions. [2025-02-06 12:05:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:05:02,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:02,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:05:02,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:05:02,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1787444445, now seen corresponding path program 1 times [2025-02-06 12:05:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:02,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860529655] [2025-02-06 12:05:02,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:02,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:02,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:05:02,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:05:02,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:02,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:05:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860529655] [2025-02-06 12:05:03,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860529655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:03,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:05:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698550378] [2025-02-06 12:05:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:03,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:05:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:03,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:05:03,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:05:03,139 INFO L87 Difference]: Start difference. First operand 325 states and 355 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:03,172 INFO L93 Difference]: Finished difference Result 328 states and 359 transitions. [2025-02-06 12:05:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:05:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 12:05:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:03,176 INFO L225 Difference]: With dead ends: 328 [2025-02-06 12:05:03,176 INFO L226 Difference]: Without dead ends: 328 [2025-02-06 12:05:03,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:05:03,178 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 2 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:03,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 699 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:05:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-06 12:05:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2025-02-06 12:05:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 175 states have (on average 1.9542857142857142) internal successors, (342), 316 states have internal predecessors, (342), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 356 transitions. [2025-02-06 12:05:03,202 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 356 transitions. Word has length 6 [2025-02-06 12:05:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:03,203 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 356 transitions. [2025-02-06 12:05:03,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 356 transitions. [2025-02-06 12:05:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:05:03,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:03,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:05:03,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:05:03,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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 206 more)] === [2025-02-06 12:05:03,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1787444606, now seen corresponding path program 1 times [2025-02-06 12:05:03,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:03,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405553681] [2025-02-06 12:05:03,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:03,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:05:03,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:05:03,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:03,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:05:03,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405553681] [2025-02-06 12:05:03,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405553681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:03,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:03,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:05:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892016638] [2025-02-06 12:05:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:03,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:05:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:03,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:05:03,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:05:03,808 INFO L87 Difference]: Start difference. First operand 326 states and 356 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:07,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:11,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:12,149 INFO L93 Difference]: Finished difference Result 328 states and 358 transitions. [2025-02-06 12:05:12,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:05:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 12:05:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:12,151 INFO L225 Difference]: With dead ends: 328 [2025-02-06 12:05:12,152 INFO L226 Difference]: Without dead ends: 328 [2025-02-06 12:05:12,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:05:12,154 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 11 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:12,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 552 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-06 12:05:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-06 12:05:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2025-02-06 12:05:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 176 states have (on average 1.9488636363636365) internal successors, (343), 317 states have internal predecessors, (343), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 357 transitions. [2025-02-06 12:05:12,176 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 357 transitions. Word has length 6 [2025-02-06 12:05:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:12,181 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 357 transitions. [2025-02-06 12:05:12,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 357 transitions. [2025-02-06 12:05:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:05:12,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:12,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:12,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:05:12,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:12,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash 758114730, now seen corresponding path program 1 times [2025-02-06 12:05:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:12,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135723894] [2025-02-06 12:05:12,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:12,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:05:12,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:05:12,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:12,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:12,522 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-06 12:05:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:12,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135723894] [2025-02-06 12:05:12,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135723894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:12,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618392007] [2025-02-06 12:05:12,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:12,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:12,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:12,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:05:12,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:05:12,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:05:12,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:12,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:12,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:05:12,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:13,011 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-06 12:05:13,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:13,043 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-06 12:05:13,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618392007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:13,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:13,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:05:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059525130] [2025-02-06 12:05:13,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:13,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:05:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:13,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:05:13,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:05:13,047 INFO L87 Difference]: Start difference. First operand 327 states and 357 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:13,087 INFO L93 Difference]: Finished difference Result 335 states and 367 transitions. [2025-02-06 12:05:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:05:13,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:05:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:13,090 INFO L225 Difference]: With dead ends: 335 [2025-02-06 12:05:13,090 INFO L226 Difference]: Without dead ends: 335 [2025-02-06 12:05:13,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:05:13,090 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 4 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:13,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 699 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:05:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-02-06 12:05:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2025-02-06 12:05:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 184 states have (on average 1.9184782608695652) internal successors, (353), 325 states have internal predecessors, (353), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 367 transitions. [2025-02-06 12:05:13,103 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 367 transitions. Word has length 9 [2025-02-06 12:05:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:13,103 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 367 transitions. [2025-02-06 12:05:13,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 367 transitions. [2025-02-06 12:05:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:05:13,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:13,104 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:13,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:05:13,308 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-06 12:05:13,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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 206 more)] === [2025-02-06 12:05:13,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 758114891, now seen corresponding path program 1 times [2025-02-06 12:05:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954856031] [2025-02-06 12:05:13,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:13,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:05:13,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:05:13,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:13,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:05:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954856031] [2025-02-06 12:05:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954856031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303789607] [2025-02-06 12:05:13,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:13,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:13,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:13,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:13,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:05:14,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:05:14,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:05:14,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:14,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:14,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:05:14,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:05:14,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:14,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-06 12:05:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:05:14,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303789607] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:14,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:14,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:05:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845417907] [2025-02-06 12:05:14,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:05:14,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:14,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:05:14,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:05:14,641 INFO L87 Difference]: Start difference. First operand 335 states and 367 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:18,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:22,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:26,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:30,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:34,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:35,503 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2025-02-06 12:05:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:05:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:05:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:35,505 INFO L225 Difference]: With dead ends: 334 [2025-02-06 12:05:35,505 INFO L226 Difference]: Without dead ends: 334 [2025-02-06 12:05:35,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:05:35,506 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 435 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:35,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1077 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 477 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2025-02-06 12:05:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-06 12:05:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-02-06 12:05:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 184 states have (on average 1.9021739130434783) internal successors, (350), 324 states have internal predecessors, (350), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 364 transitions. [2025-02-06 12:05:35,513 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 364 transitions. Word has length 9 [2025-02-06 12:05:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:35,513 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 364 transitions. [2025-02-06 12:05:35,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 364 transitions. [2025-02-06 12:05:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:05:35,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:35,514 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:35,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:05:35,715 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-06 12:05:35,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:35,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1473607325, now seen corresponding path program 2 times [2025-02-06 12:05:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755920552] [2025-02-06 12:05:35,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:35,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 12:05:35,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 12:05:35,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:05:35,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:36,340 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-06 12:05:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755920552] [2025-02-06 12:05:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755920552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:36,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:05:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331053758] [2025-02-06 12:05:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:05:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:36,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:05:36,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:36,344 INFO L87 Difference]: Start difference. First operand 334 states and 364 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:37,064 INFO L93 Difference]: Finished difference Result 479 states and 526 transitions. [2025-02-06 12:05:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:05:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 12:05:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:37,067 INFO L225 Difference]: With dead ends: 479 [2025-02-06 12:05:37,067 INFO L226 Difference]: Without dead ends: 479 [2025-02-06 12:05:37,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:37,069 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 391 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:37,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 778 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:05:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-06 12:05:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 337. [2025-02-06 12:05:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 187 states have (on average 1.8823529411764706) internal successors, (352), 326 states have internal predecessors, (352), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 366 transitions. [2025-02-06 12:05:37,087 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 366 transitions. Word has length 18 [2025-02-06 12:05:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:37,087 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 366 transitions. [2025-02-06 12:05:37,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 366 transitions. [2025-02-06 12:05:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:05:37,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:37,088 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:37,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:05:37,088 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:37,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1473607326, now seen corresponding path program 1 times [2025-02-06 12:05:37,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:37,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951058374] [2025-02-06 12:05:37,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:37,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:37,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:05:37,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:05:37,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:37,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:37,601 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-06 12:05:37,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951058374] [2025-02-06 12:05:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951058374] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932663282] [2025-02-06 12:05:37,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:37,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:37,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:37,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:37,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:05:38,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:05:38,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:05:38,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:38,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:38,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:05:38,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:38,225 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-06 12:05:38,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:38,349 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-06 12:05:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932663282] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:38,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:38,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:05:38,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412567602] [2025-02-06 12:05:38,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:38,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:05:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:38,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:05:38,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:05:38,351 INFO L87 Difference]: Start difference. First operand 337 states and 366 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:38,449 INFO L93 Difference]: Finished difference Result 355 states and 384 transitions. [2025-02-06 12:05:38,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:05:38,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 18 [2025-02-06 12:05:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:38,451 INFO L225 Difference]: With dead ends: 355 [2025-02-06 12:05:38,451 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 12:05:38,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:05:38,452 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 4 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:38,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1391 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:05:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 12:05:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-02-06 12:05:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 205 states have (on average 1.8048780487804879) internal successors, (370), 344 states have internal predecessors, (370), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 384 transitions. [2025-02-06 12:05:38,473 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 384 transitions. Word has length 18 [2025-02-06 12:05:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:38,474 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 384 transitions. [2025-02-06 12:05:38,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 384 transitions. [2025-02-06 12:05:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:05:38,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:38,474 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:38,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:05:38,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:38,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:38,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1945706814, now seen corresponding path program 2 times [2025-02-06 12:05:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:38,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031765394] [2025-02-06 12:05:38,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:38,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:05:38,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-02-06 12:05:38,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:05:38,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:39,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031765394] [2025-02-06 12:05:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031765394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:39,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:05:39,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935740907] [2025-02-06 12:05:39,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:39,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:05:39,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:39,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:05:39,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:05:39,372 INFO L87 Difference]: Start difference. First operand 355 states and 384 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:43,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:44,511 INFO L93 Difference]: Finished difference Result 641 states and 697 transitions. [2025-02-06 12:05:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:05:44,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-06 12:05:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:44,514 INFO L225 Difference]: With dead ends: 641 [2025-02-06 12:05:44,514 INFO L226 Difference]: Without dead ends: 641 [2025-02-06 12:05:44,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:44,515 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 431 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:44,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 625 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 641 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-02-06 12:05:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-02-06 12:05:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 354. [2025-02-06 12:05:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 205 states have (on average 1.8) internal successors, (369), 343 states have internal predecessors, (369), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 383 transitions. [2025-02-06 12:05:44,548 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 383 transitions. Word has length 36 [2025-02-06 12:05:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:44,548 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 383 transitions. [2025-02-06 12:05:44,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 383 transitions. [2025-02-06 12:05:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:05:44,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:44,554 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:44,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:05:44,554 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:44,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 613898046, now seen corresponding path program 1 times [2025-02-06 12:05:44,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:44,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081262398] [2025-02-06 12:05:44,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:45,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:05:45,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:05:45,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:45,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:46,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:46,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081262398] [2025-02-06 12:05:46,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081262398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:46,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:46,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:05:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846857241] [2025-02-06 12:05:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:46,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:05:46,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:46,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:05:46,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:05:46,272 INFO L87 Difference]: Start difference. First operand 354 states and 383 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:46,512 INFO L93 Difference]: Finished difference Result 354 states and 384 transitions. [2025-02-06 12:05:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:05:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-02-06 12:05:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:46,514 INFO L225 Difference]: With dead ends: 354 [2025-02-06 12:05:46,515 INFO L226 Difference]: Without dead ends: 354 [2025-02-06 12:05:46,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:05:46,516 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 384 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:46,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1255 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:05:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-02-06 12:05:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2025-02-06 12:05:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 205 states have (on average 1.7951219512195122) internal successors, (368), 342 states have internal predecessors, (368), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 382 transitions. [2025-02-06 12:05:46,524 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 382 transitions. Word has length 44 [2025-02-06 12:05:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:46,525 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 382 transitions. [2025-02-06 12:05:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 382 transitions. [2025-02-06 12:05:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:05:46,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:46,526 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:46,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:05:46,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:46,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash 613898045, now seen corresponding path program 1 times [2025-02-06 12:05:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:46,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035684166] [2025-02-06 12:05:46,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:46,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:46,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:05:46,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:05:46,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:46,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:46,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035684166] [2025-02-06 12:05:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035684166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:05:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806248186] [2025-02-06 12:05:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:46,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:05:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:46,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:05:46,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:05:46,924 INFO L87 Difference]: Start difference. First operand 353 states and 382 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:50,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:51,203 INFO L93 Difference]: Finished difference Result 396 states and 430 transitions. [2025-02-06 12:05:51,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:05:51,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-02-06 12:05:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:51,205 INFO L225 Difference]: With dead ends: 396 [2025-02-06 12:05:51,205 INFO L226 Difference]: Without dead ends: 396 [2025-02-06 12:05:51,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:05:51,206 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 74 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:51,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 481 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 12:05:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-06 12:05:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 348. [2025-02-06 12:05:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 205 states have (on average 1.7707317073170732) internal successors, (363), 337 states have internal predecessors, (363), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 377 transitions. [2025-02-06 12:05:51,215 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 377 transitions. Word has length 44 [2025-02-06 12:05:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:51,215 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 377 transitions. [2025-02-06 12:05:51,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 377 transitions. [2025-02-06 12:05:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:05:51,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:51,217 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:51,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:05:51,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 666324288, now seen corresponding path program 1 times [2025-02-06 12:05:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:51,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211492491] [2025-02-06 12:05:51,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:51,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:05:51,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:05:51,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:51,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:51,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211492491] [2025-02-06 12:05:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211492491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:51,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:51,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:05:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295139245] [2025-02-06 12:05:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:51,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:05:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:51,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:05:51,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:51,789 INFO L87 Difference]: Start difference. First operand 348 states and 377 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:52,081 INFO L93 Difference]: Finished difference Result 414 states and 451 transitions. [2025-02-06 12:05:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:05:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:05:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:52,084 INFO L225 Difference]: With dead ends: 414 [2025-02-06 12:05:52,084 INFO L226 Difference]: Without dead ends: 414 [2025-02-06 12:05:52,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:52,085 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 384 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:52,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 573 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:05:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-06 12:05:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 361. [2025-02-06 12:05:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 219 states have (on average 1.7534246575342465) internal successors, (384), 350 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:05:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 398 transitions. [2025-02-06 12:05:52,092 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 398 transitions. Word has length 47 [2025-02-06 12:05:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:52,092 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 398 transitions. [2025-02-06 12:05:52,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 398 transitions. [2025-02-06 12:05:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:05:52,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:52,094 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:52,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:05:52,094 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:05:52,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash 666323359, now seen corresponding path program 1 times [2025-02-06 12:05:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:52,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504719069] [2025-02-06 12:05:52,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:52,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:05:52,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:05:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:52,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:52,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:52,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504719069] [2025-02-06 12:05:52,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504719069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:52,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:05:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051182203] [2025-02-06 12:05:52,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:52,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:05:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:52,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:05:52,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:05:52,494 INFO L87 Difference]: Start difference. First operand 361 states and 398 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:56,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:00,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:00,818 INFO L93 Difference]: Finished difference Result 406 states and 448 transitions. [2025-02-06 12:06:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:06:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:06:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:00,821 INFO L225 Difference]: With dead ends: 406 [2025-02-06 12:06:00,821 INFO L226 Difference]: Without dead ends: 406 [2025-02-06 12:06:00,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:06:00,822 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 245 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:00,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 543 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 321 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-06 12:06:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-06 12:06:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 359. [2025-02-06 12:06:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 219 states have (on average 1.7442922374429224) internal successors, (382), 348 states have internal predecessors, (382), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 396 transitions. [2025-02-06 12:06:00,831 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 396 transitions. Word has length 47 [2025-02-06 12:06:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:00,831 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 396 transitions. [2025-02-06 12:06:00,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:06:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 396 transitions. [2025-02-06 12:06:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:06:00,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:00,831 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:00,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:06:00,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:06:00,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash 666323360, now seen corresponding path program 1 times [2025-02-06 12:06:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994371594] [2025-02-06 12:06:00,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:00,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:06:01,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:06:01,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:01,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994371594] [2025-02-06 12:06:01,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994371594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:01,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:01,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:06:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158879357] [2025-02-06 12:06:01,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:01,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:06:01,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:01,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:06:01,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:01,345 INFO L87 Difference]: Start difference. First operand 359 states and 396 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:06:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:01,433 INFO L93 Difference]: Finished difference Result 364 states and 395 transitions. [2025-02-06 12:06:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:06:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:06:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:01,436 INFO L225 Difference]: With dead ends: 364 [2025-02-06 12:06:01,436 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 12:06:01,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:06:01,438 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 202 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:01,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1429 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:06:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 12:06:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 359. [2025-02-06 12:06:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 219 states have (on average 1.7397260273972603) internal successors, (381), 348 states have internal predecessors, (381), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 395 transitions. [2025-02-06 12:06:01,444 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 395 transitions. Word has length 47 [2025-02-06 12:06:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:01,445 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 395 transitions. [2025-02-06 12:06:01,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:06:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 395 transitions. [2025-02-06 12:06:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:06:01,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:01,447 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:01,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:06:01,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:06:01,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -871601064, now seen corresponding path program 1 times [2025-02-06 12:06:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:01,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330296130] [2025-02-06 12:06:01,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:01,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:06:01,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:06:01,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:01,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330296130] [2025-02-06 12:06:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330296130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:01,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:06:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137592549] [2025-02-06 12:06:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:01,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:06:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:01,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:06:01,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:01,850 INFO L87 Difference]: Start difference. First operand 359 states and 395 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:06:05,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:06:06,086 INFO L93 Difference]: Finished difference Result 405 states and 445 transitions. [2025-02-06 12:06:06,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:06:06,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-06 12:06:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:06:06,088 INFO L225 Difference]: With dead ends: 405 [2025-02-06 12:06:06,089 INFO L226 Difference]: Without dead ends: 405 [2025-02-06 12:06:06,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:06:06,090 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 74 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:06:06,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 475 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 12:06:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-06 12:06:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 358. [2025-02-06 12:06:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 219 states have (on average 1.730593607305936) internal successors, (379), 347 states have internal predecessors, (379), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 12:06:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 393 transitions. [2025-02-06 12:06:06,099 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 393 transitions. Word has length 50 [2025-02-06 12:06:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:06:06,099 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 393 transitions. [2025-02-06 12:06:06,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:06:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 393 transitions. [2025-02-06 12:06:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:06:06,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:06:06,101 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:06:06,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:06:06,101 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-06 12:06:06,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:06:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash -871601063, now seen corresponding path program 1 times [2025-02-06 12:06:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:06:06,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734987810] [2025-02-06 12:06:06,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:06:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:06:06,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:06:06,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:06:06,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:06:06,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:06:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:06:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:06:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734987810] [2025-02-06 12:06:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734987810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:06:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:06:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:06:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320833590] [2025-02-06 12:06:07,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:06:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:06:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:06:07,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:06:07,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:06:07,056 INFO L87 Difference]: Start difference. First operand 358 states and 393 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:06:11,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:06:15,087 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 []