./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/busybox-1.22.0/wc-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/wc-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b8000edc920fe8a32bdc36b56c8860a94e8d6d6bafdb81a520b0f73a8e153aaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:17:59,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:18:00,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 10:18:00,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:18:00,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:18:00,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:18:00,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:18:00,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:18:00,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:18:00,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:18:00,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:18:00,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:18:00,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:18:00,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:18:00,074 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:18:00,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:18:00,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:18:00,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:18:00,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:18:00,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:18:00,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:18:00,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:18:00,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:18:00,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:18:00,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:18:00,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:18:00,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:18:00,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:18:00,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:18:00,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:18:00,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:18:00,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:18:00,077 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> b8000edc920fe8a32bdc36b56c8860a94e8d6d6bafdb81a520b0f73a8e153aaa [2025-03-17 10:18:00,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:18:00,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:18:00,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:18:00,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:18:00,349 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:18:00,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-03-17 10:18:01,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770d7f5bc/8ffc0aa1f4144c98b2baf85f6c19be8b/FLAG2af6778db [2025-03-17 10:18:01,937 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:18:01,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-03-17 10:18:01,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770d7f5bc/8ffc0aa1f4144c98b2baf85f6c19be8b/FLAG2af6778db [2025-03-17 10:18:01,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770d7f5bc/8ffc0aa1f4144c98b2baf85f6c19be8b [2025-03-17 10:18:01,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:18:01,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:18:01,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:18:01,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:18:01,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:18:01,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:18:01" (1/1) ... [2025-03-17 10:18:01,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69348bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:01, skipping insertion in model container [2025-03-17 10:18:01,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:18:01" (1/1) ... [2025-03-17 10:18:02,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:18:02,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-03-17 10:18:02,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:18:02,780 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:18:02,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-03-17 10:18:02,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:18:03,038 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 10:18:03,046 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:18:03,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03 WrapperNode [2025-03-17 10:18:03,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:18:03,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:18:03,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:18:03,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:18:03,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,194 INFO L138 Inliner]: procedures = 577, calls = 806, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 2104 [2025-03-17 10:18:03,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:18:03,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:18:03,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:18:03,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:18:03,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,226 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 10:18:03,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:18:03,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:18:03,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:18:03,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:18:03,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (1/1) ... [2025-03-17 10:18:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:18:03,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:18:03,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:18:03,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:18:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:18:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 10:18:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-17 10:18:03,373 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-17 10:18:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 10:18:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:18:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 10:18:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-17 10:18:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-17 10:18:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-17 10:18:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 10:18:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-17 10:18:03,374 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-17 10:18:03,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:18:03,721 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:18:03,722 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:18:10,098 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2911: call ULTIMATE.dealloc(__main_~#counts~0#1.base, __main_~#counts~0#1.offset);havoc __main_~#counts~0#1.base, __main_~#counts~0#1.offset;call ULTIMATE.dealloc(__main_~#totals~0#1.base, __main_~#totals~0#1.offset);havoc __main_~#totals~0#1.base, __main_~#totals~0#1.offset; [2025-03-17 10:18:10,098 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: havoc getopt_long_#t~ret291#1; [2025-03-17 10:18:10,098 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: havoc __main_~return_value_ferror$2~0#1; [2025-03-17 10:18:10,098 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164: havoc _IO_getc_#t~nondet262#1; [2025-03-17 10:18:10,098 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc fclose_if_not_stdin_#t~bitwise74#1; [2025-03-17 10:18:10,098 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-17 10:18:10,229 INFO L? ?]: Removed 541 outVars from TransFormulas that were not future-live. [2025-03-17 10:18:10,230 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:18:10,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:18:10,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:18:10,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:18:10 BoogieIcfgContainer [2025-03-17 10:18:10,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:18:10,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:18:10,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:18:10,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:18:10,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:18:01" (1/3) ... [2025-03-17 10:18:10,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78499c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:18:10, skipping insertion in model container [2025-03-17 10:18:10,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:18:03" (2/3) ... [2025-03-17 10:18:10,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78499c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:18:10, skipping insertion in model container [2025-03-17 10:18:10,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:18:10" (3/3) ... [2025-03-17 10:18:10,283 INFO L128 eAbstractionObserver]: Analyzing ICFG wc-2.i [2025-03-17 10:18:10,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:18:10,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wc-2.i that has 8 procedures, 433 locations, 1 initial locations, 33 loop locations, and 4 error locations. [2025-03-17 10:18:10,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:18:10,372 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=LoopHeads, 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;@102a910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:18:10,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 10:18:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 433 states, 399 states have (on average 1.6215538847117794) internal successors, (647), 405 states have internal predecessors, (647), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 10:18:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 10:18:10,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:10,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:10,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:10,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1657133850, now seen corresponding path program 1 times [2025-03-17 10:18:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669640516] [2025-03-17 10:18:10,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:10,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 10:18:11,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 10:18:11,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:11,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669640516] [2025-03-17 10:18:11,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669640516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:11,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:11,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:11,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127351383] [2025-03-17 10:18:11,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:11,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:11,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:11,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:11,518 INFO L87 Difference]: Start difference. First operand has 433 states, 399 states have (on average 1.6215538847117794) internal successors, (647), 405 states have internal predecessors, (647), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:11,748 INFO L93 Difference]: Finished difference Result 819 states and 1322 transitions. [2025-03-17 10:18:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-03-17 10:18:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:11,758 INFO L225 Difference]: With dead ends: 819 [2025-03-17 10:18:11,758 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 10:18:11,764 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-03-17 10:18:11,766 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:11,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1114 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 10:18:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-03-17 10:18:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 367 states have internal predecessors, (553), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 584 transitions. [2025-03-17 10:18:11,836 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 584 transitions. Word has length 43 [2025-03-17 10:18:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:11,837 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 584 transitions. [2025-03-17 10:18:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 584 transitions. [2025-03-17 10:18:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 10:18:11,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:11,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:18:11,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 308117309, now seen corresponding path program 1 times [2025-03-17 10:18:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069219281] [2025-03-17 10:18:11,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:12,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 10:18:12,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 10:18:12,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:12,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:12,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:12,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069219281] [2025-03-17 10:18:12,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069219281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:18:12,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591634924] [2025-03-17 10:18:12,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:12,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:12,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:18:12,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:18:12,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:18:13,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 10:18:13,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 10:18:13,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:13,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:13,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:18:13,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:18:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:13,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:18:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591634924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:18:13,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:18:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-17 10:18:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932308196] [2025-03-17 10:18:13,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:18:13,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:18:13,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:13,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:18:13,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:18:13,622 INFO L87 Difference]: Start difference. First operand 387 states and 584 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:18:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:13,822 INFO L93 Difference]: Finished difference Result 774 states and 1170 transitions. [2025-03-17 10:18:13,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2025-03-17 10:18:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:13,825 INFO L225 Difference]: With dead ends: 774 [2025-03-17 10:18:13,825 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 10:18:13,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 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-03-17 10:18:13,827 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 0 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:13,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1667 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 10:18:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-17 10:18:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 363 states have (on average 1.5316804407713498) internal successors, (556), 370 states have internal predecessors, (556), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 587 transitions. [2025-03-17 10:18:13,843 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 587 transitions. Word has length 47 [2025-03-17 10:18:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:13,843 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 587 transitions. [2025-03-17 10:18:13,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:18:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 587 transitions. [2025-03-17 10:18:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 10:18:13,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:13,845 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:13,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:18:14,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:14,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:14,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1617261613, now seen corresponding path program 2 times [2025-03-17 10:18:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:14,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223221781] [2025-03-17 10:18:14,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:18:14,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:14,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 10:18:14,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 50 statements. [2025-03-17 10:18:14,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:18:14,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:18:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223221781] [2025-03-17 10:18:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223221781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:18:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195416199] [2025-03-17 10:18:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:14,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:18:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:14,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:18:14,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:18:14,852 INFO L87 Difference]: Start difference. First operand 390 states and 587 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:15,157 INFO L93 Difference]: Finished difference Result 885 states and 1354 transitions. [2025-03-17 10:18:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:18:15,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-03-17 10:18:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:15,161 INFO L225 Difference]: With dead ends: 885 [2025-03-17 10:18:15,161 INFO L226 Difference]: Without dead ends: 573 [2025-03-17 10:18:15,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03-17 10:18:15,162 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1100 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:15,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1063 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:18:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-17 10:18:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 391. [2025-03-17 10:18:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 364 states have (on average 1.5302197802197801) internal successors, (557), 371 states have internal predecessors, (557), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 588 transitions. [2025-03-17 10:18:15,179 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 588 transitions. Word has length 50 [2025-03-17 10:18:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:15,180 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 588 transitions. [2025-03-17 10:18:15,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 588 transitions. [2025-03-17 10:18:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 10:18:15,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:15,181 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:18:15,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:15,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash -263951916, now seen corresponding path program 1 times [2025-03-17 10:18:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104695197] [2025-03-17 10:18:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:15,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:18:15,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:18:15,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:15,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:18:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104695197] [2025-03-17 10:18:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104695197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:18:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901355840] [2025-03-17 10:18:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:15,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:18:15,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:15,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:18:15,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:15,851 INFO L87 Difference]: Start difference. First operand 391 states and 588 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:16,177 INFO L93 Difference]: Finished difference Result 404 states and 600 transitions. [2025-03-17 10:18:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-03-17 10:18:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:16,179 INFO L225 Difference]: With dead ends: 404 [2025-03-17 10:18:16,179 INFO L226 Difference]: Without dead ends: 399 [2025-03-17 10:18:16,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:18:16,180 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 13 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:16,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2765 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:18:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-17 10:18:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2025-03-17 10:18:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 368 states have (on average 1.5244565217391304) internal successors, (561), 374 states have internal predecessors, (561), 19 states have call successors, (19), 9 states have call predecessors, (19), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 593 transitions. [2025-03-17 10:18:16,195 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 593 transitions. Word has length 50 [2025-03-17 10:18:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:16,197 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 593 transitions. [2025-03-17 10:18:16,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 593 transitions. [2025-03-17 10:18:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 10:18:16,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:16,201 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:16,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:18:16,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:16,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -263950955, now seen corresponding path program 1 times [2025-03-17 10:18:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849428697] [2025-03-17 10:18:16,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:16,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:18:16,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:18:16,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:16,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:16,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849428697] [2025-03-17 10:18:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849428697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:18:16,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38295657] [2025-03-17 10:18:16,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:16,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:16,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:18:16,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:18:16,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:18:17,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:18:17,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:18:17,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:17,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:17,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:18:17,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:18:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:17,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:18:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:17,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38295657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:18:17,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:18:17,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2025-03-17 10:18:17,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362115102] [2025-03-17 10:18:17,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:18:17,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 10:18:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:17,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 10:18:17,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:18:17,689 INFO L87 Difference]: Start difference. First operand 396 states and 593 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:18:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:17,894 INFO L93 Difference]: Finished difference Result 792 states and 1191 transitions. [2025-03-17 10:18:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 10:18:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-03-17 10:18:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:17,897 INFO L225 Difference]: With dead ends: 792 [2025-03-17 10:18:17,897 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 10:18:17,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 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-03-17 10:18:17,898 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 0 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:17,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2777 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 10:18:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-03-17 10:18:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 374 states have (on average 1.5160427807486632) internal successors, (567), 380 states have internal predecessors, (567), 19 states have call successors, (19), 9 states have call predecessors, (19), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 599 transitions. [2025-03-17 10:18:17,914 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 599 transitions. Word has length 50 [2025-03-17 10:18:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:17,914 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 599 transitions. [2025-03-17 10:18:17,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 10:18:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 599 transitions. [2025-03-17 10:18:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 10:18:17,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:17,916 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:17,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 10:18:18,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:18,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:18,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1194666667, now seen corresponding path program 2 times [2025-03-17 10:18:18,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:18,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743169081] [2025-03-17 10:18:18,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:18:18,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:18,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-17 10:18:18,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-03-17 10:18:18,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:18:18,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743169081] [2025-03-17 10:18:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743169081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:18,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697435485] [2025-03-17 10:18:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:18,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:18,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:18,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:18,757 INFO L87 Difference]: Start difference. First operand 402 states and 599 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:18,869 INFO L93 Difference]: Finished difference Result 773 states and 1151 transitions. [2025-03-17 10:18:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:18,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2025-03-17 10:18:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:18,871 INFO L225 Difference]: With dead ends: 773 [2025-03-17 10:18:18,871 INFO L226 Difference]: Without dead ends: 406 [2025-03-17 10:18:18,872 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-03-17 10:18:18,872 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 21 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:18,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1085 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-17 10:18:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-17 10:18:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 377 states have (on average 1.509283819628647) internal successors, (569), 383 states have internal predecessors, (569), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 601 transitions. [2025-03-17 10:18:18,883 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 601 transitions. Word has length 56 [2025-03-17 10:18:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:18,884 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 601 transitions. [2025-03-17 10:18:18,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 601 transitions. [2025-03-17 10:18:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 10:18:18,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:18,885 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:18,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:18:18,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash -279135329, now seen corresponding path program 1 times [2025-03-17 10:18:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:18,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963946914] [2025-03-17 10:18:18,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:19,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 10:18:19,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 10:18:19,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:19,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963946914] [2025-03-17 10:18:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963946914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:19,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:18:19,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367025287] [2025-03-17 10:18:19,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:19,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:18:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:19,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:18:19,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:18:19,417 INFO L87 Difference]: Start difference. First operand 406 states and 601 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:19,595 INFO L93 Difference]: Finished difference Result 793 states and 1181 transitions. [2025-03-17 10:18:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:18:19,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2025-03-17 10:18:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:19,598 INFO L225 Difference]: With dead ends: 793 [2025-03-17 10:18:19,598 INFO L226 Difference]: Without dead ends: 411 [2025-03-17 10:18:19,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:18:19,599 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:19,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2194 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-17 10:18:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-17 10:18:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 382 states have (on average 1.5026178010471205) internal successors, (574), 388 states have internal predecessors, (574), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 606 transitions. [2025-03-17 10:18:19,610 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 606 transitions. Word has length 64 [2025-03-17 10:18:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:19,610 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 606 transitions. [2025-03-17 10:18:19,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 606 transitions. [2025-03-17 10:18:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 10:18:19,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:19,611 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:19,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:18:19,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:19,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash 745558592, now seen corresponding path program 1 times [2025-03-17 10:18:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:19,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008899219] [2025-03-17 10:18:19,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:19,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:19,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 10:18:19,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 10:18:19,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:19,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008899219] [2025-03-17 10:18:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008899219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:18:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110112146] [2025-03-17 10:18:20,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:20,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:18:20,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:20,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:18:20,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:18:20,223 INFO L87 Difference]: Start difference. First operand 411 states and 606 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:20,420 INFO L93 Difference]: Finished difference Result 791 states and 1175 transitions. [2025-03-17 10:18:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:18:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2025-03-17 10:18:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:20,422 INFO L225 Difference]: With dead ends: 791 [2025-03-17 10:18:20,422 INFO L226 Difference]: Without dead ends: 411 [2025-03-17 10:18:20,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:18:20,424 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:20,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1652 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-17 10:18:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-17 10:18:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 382 states have (on average 1.5) internal successors, (573), 388 states have internal predecessors, (573), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 605 transitions. [2025-03-17 10:18:20,435 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 605 transitions. Word has length 64 [2025-03-17 10:18:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:20,435 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 605 transitions. [2025-03-17 10:18:20,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 605 transitions. [2025-03-17 10:18:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 10:18:20,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:20,436 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:20,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:18:20,436 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -711174782, now seen corresponding path program 1 times [2025-03-17 10:18:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108014587] [2025-03-17 10:18:20,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:20,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 10:18:20,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 10:18:20,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:20,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108014587] [2025-03-17 10:18:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108014587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:21,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:21,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:18:21,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764989118] [2025-03-17 10:18:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:21,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:18:21,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:21,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:18:21,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:18:21,016 INFO L87 Difference]: Start difference. First operand 411 states and 605 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:21,194 INFO L93 Difference]: Finished difference Result 790 states and 1172 transitions. [2025-03-17 10:18:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:18:21,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2025-03-17 10:18:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:21,197 INFO L225 Difference]: With dead ends: 790 [2025-03-17 10:18:21,197 INFO L226 Difference]: Without dead ends: 413 [2025-03-17 10:18:21,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:18:21,199 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:21,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1651 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-17 10:18:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-17 10:18:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 384 states have (on average 1.4973958333333333) internal successors, (575), 390 states have internal predecessors, (575), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 607 transitions. [2025-03-17 10:18:21,212 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 607 transitions. Word has length 66 [2025-03-17 10:18:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:21,212 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 607 transitions. [2025-03-17 10:18:21,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 607 transitions. [2025-03-17 10:18:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 10:18:21,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:21,213 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:21,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:18:21,214 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:21,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1159871421, now seen corresponding path program 1 times [2025-03-17 10:18:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:21,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205086038] [2025-03-17 10:18:21,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:21,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 10:18:21,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 10:18:21,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:21,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205086038] [2025-03-17 10:18:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205086038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:21,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:21,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:18:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566486026] [2025-03-17 10:18:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:21,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:18:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:21,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:18:21,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:21,907 INFO L87 Difference]: Start difference. First operand 413 states and 607 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:22,174 INFO L93 Difference]: Finished difference Result 784 states and 1162 transitions. [2025-03-17 10:18:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:22,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2025-03-17 10:18:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:22,177 INFO L225 Difference]: With dead ends: 784 [2025-03-17 10:18:22,178 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 10:18:22,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:18:22,179 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:22,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2747 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 10:18:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2025-03-17 10:18:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 384 states have (on average 1.4973958333333333) internal successors, (575), 390 states have internal predecessors, (575), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 607 transitions. [2025-03-17 10:18:22,193 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 607 transitions. Word has length 66 [2025-03-17 10:18:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:22,193 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 607 transitions. [2025-03-17 10:18:22,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 607 transitions. [2025-03-17 10:18:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:18:22,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:22,196 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:18:22,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 770626599, now seen corresponding path program 1 times [2025-03-17 10:18:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642861873] [2025-03-17 10:18:22,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:22,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:18:22,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:18:22,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:22,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642861873] [2025-03-17 10:18:22,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642861873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:22,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:22,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:18:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080919137] [2025-03-17 10:18:22,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:22,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:18:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:22,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:18:22,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:18:22,795 INFO L87 Difference]: Start difference. First operand 413 states and 607 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:22,933 INFO L93 Difference]: Finished difference Result 785 states and 1163 transitions. [2025-03-17 10:18:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:18:22,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2025-03-17 10:18:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:22,936 INFO L225 Difference]: With dead ends: 785 [2025-03-17 10:18:22,936 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 10:18:22,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:18:22,937 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:22,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1658 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 10:18:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-17 10:18:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 386 states have (on average 1.494818652849741) internal successors, (577), 392 states have internal predecessors, (577), 19 states have call successors, (19), 10 states have call predecessors, (19), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 609 transitions. [2025-03-17 10:18:22,949 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 609 transitions. Word has length 68 [2025-03-17 10:18:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:22,949 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 609 transitions. [2025-03-17 10:18:22,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 609 transitions. [2025-03-17 10:18:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:18:22,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:22,952 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:22,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:18:22,952 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:22,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash 894699846, now seen corresponding path program 1 times [2025-03-17 10:18:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640825886] [2025-03-17 10:18:22,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:22,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:23,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:18:23,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:18:23,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:23,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640825886] [2025-03-17 10:18:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640825886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13673985] [2025-03-17 10:18:23,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:23,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:23,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:23,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:23,563 INFO L87 Difference]: Start difference. First operand 415 states and 609 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:23,638 INFO L93 Difference]: Finished difference Result 661 states and 976 transitions. [2025-03-17 10:18:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:23,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2025-03-17 10:18:23,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:23,641 INFO L225 Difference]: With dead ends: 661 [2025-03-17 10:18:23,641 INFO L226 Difference]: Without dead ends: 344 [2025-03-17 10:18:23,641 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-03-17 10:18:23,643 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:23,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 908 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-17 10:18:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-03-17 10:18:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 317 states have (on average 1.473186119873817) internal successors, (467), 323 states have internal predecessors, (467), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 497 transitions. [2025-03-17 10:18:23,653 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 497 transitions. Word has length 68 [2025-03-17 10:18:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 497 transitions. [2025-03-17 10:18:23,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 497 transitions. [2025-03-17 10:18:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 10:18:23,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:23,656 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:23,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:18:23,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:23,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash 705888814, now seen corresponding path program 1 times [2025-03-17 10:18:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:23,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649374317] [2025-03-17 10:18:23,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:23,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:23,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 10:18:24,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 10:18:24,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:24,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:24,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:24,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649374317] [2025-03-17 10:18:24,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649374317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:24,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:24,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553311164] [2025-03-17 10:18:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:24,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:24,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:24,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:24,090 INFO L87 Difference]: Start difference. First operand 344 states and 497 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:24,158 INFO L93 Difference]: Finished difference Result 585 states and 856 transitions. [2025-03-17 10:18:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:24,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2025-03-17 10:18:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:24,160 INFO L225 Difference]: With dead ends: 585 [2025-03-17 10:18:24,160 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 10:18:24,160 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-03-17 10:18:24,161 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:24,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 907 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 10:18:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 10:18:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 318 states have (on average 1.471698113207547) internal successors, (468), 324 states have internal predecessors, (468), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:18:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 498 transitions. [2025-03-17 10:18:24,171 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 498 transitions. Word has length 72 [2025-03-17 10:18:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:24,171 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 498 transitions. [2025-03-17 10:18:24,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 498 transitions. [2025-03-17 10:18:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 10:18:24,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:24,174 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:24,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:18:24,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:24,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:24,175 INFO L85 PathProgramCache]: Analyzing trace with hash -902418282, now seen corresponding path program 1 times [2025-03-17 10:18:24,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:24,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204495765] [2025-03-17 10:18:24,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:24,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 10:18:24,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 10:18:24,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:24,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:24,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204495765] [2025-03-17 10:18:24,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204495765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:24,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:24,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023224620] [2025-03-17 10:18:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:24,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:24,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:24,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:24,603 INFO L87 Difference]: Start difference. First operand 345 states and 498 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:24,654 INFO L93 Difference]: Finished difference Result 568 states and 830 transitions. [2025-03-17 10:18:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:24,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2025-03-17 10:18:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:24,656 INFO L225 Difference]: With dead ends: 568 [2025-03-17 10:18:24,656 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 10:18:24,657 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-03-17 10:18:24,657 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 227 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:24,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 619 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:18:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 10:18:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-03-17 10:18:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 301 states have (on average 1.4651162790697674) internal successors, (441), 307 states have internal predecessors, (441), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 10:18:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 467 transitions. [2025-03-17 10:18:24,666 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 467 transitions. Word has length 73 [2025-03-17 10:18:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:24,666 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 467 transitions. [2025-03-17 10:18:24,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 10:18:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 467 transitions. [2025-03-17 10:18:24,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 10:18:24,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:24,667 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:24,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:18:24,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:24,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:24,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1724798555, now seen corresponding path program 1 times [2025-03-17 10:18:24,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:24,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045106511] [2025-03-17 10:18:24,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:24,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:25,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 10:18:25,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 10:18:25,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:25,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-17 10:18:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:25,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045106511] [2025-03-17 10:18:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045106511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888385306] [2025-03-17 10:18:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:25,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:25,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:25,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:25,211 INFO L87 Difference]: Start difference. First operand 325 states and 467 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:25,293 INFO L93 Difference]: Finished difference Result 583 states and 852 transitions. [2025-03-17 10:18:25,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2025-03-17 10:18:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:25,297 INFO L225 Difference]: With dead ends: 583 [2025-03-17 10:18:25,297 INFO L226 Difference]: Without dead ends: 485 [2025-03-17 10:18:25,297 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-03-17 10:18:25,298 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 208 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:25,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 881 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-17 10:18:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 480. [2025-03-17 10:18:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 452 states have (on average 1.488938053097345) internal successors, (673), 458 states have internal predecessors, (673), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:18:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 707 transitions. [2025-03-17 10:18:25,312 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 707 transitions. Word has length 86 [2025-03-17 10:18:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:25,312 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 707 transitions. [2025-03-17 10:18:25,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 707 transitions. [2025-03-17 10:18:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 10:18:25,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:25,313 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:25,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:18:25,314 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:25,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:25,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1573096388, now seen corresponding path program 1 times [2025-03-17 10:18:25,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:25,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76937497] [2025-03-17 10:18:25,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:25,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:25,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 10:18:25,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 10:18:25,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:25,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-17 10:18:26,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76937497] [2025-03-17 10:18:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76937497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:26,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:26,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:18:26,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437406548] [2025-03-17 10:18:26,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:26,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:18:26,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:26,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:18:26,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:26,146 INFO L87 Difference]: Start difference. First operand 480 states and 707 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:18:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:26,460 INFO L93 Difference]: Finished difference Result 1139 states and 1718 transitions. [2025-03-17 10:18:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:18:26,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 86 [2025-03-17 10:18:26,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:26,464 INFO L225 Difference]: With dead ends: 1139 [2025-03-17 10:18:26,464 INFO L226 Difference]: Without dead ends: 810 [2025-03-17 10:18:26,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:18:26,466 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 238 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:26,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 2093 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-17 10:18:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 758. [2025-03-17 10:18:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 721 states have (on average 1.492371705963939) internal successors, (1076), 727 states have internal predecessors, (1076), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 10:18:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1128 transitions. [2025-03-17 10:18:26,487 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1128 transitions. Word has length 86 [2025-03-17 10:18:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:26,487 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1128 transitions. [2025-03-17 10:18:26,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:18:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1128 transitions. [2025-03-17 10:18:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 10:18:26,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:26,489 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:26,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:18:26,489 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:26,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1604116195, now seen corresponding path program 1 times [2025-03-17 10:18:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:26,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138685568] [2025-03-17 10:18:26,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:26,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 10:18:26,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 10:18:26,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:26,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138685568] [2025-03-17 10:18:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138685568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:27,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:27,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:18:27,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325194693] [2025-03-17 10:18:27,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:27,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:18:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:27,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:18:27,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:27,401 INFO L87 Difference]: Start difference. First operand 758 states and 1128 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:31,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:35,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:36,078 INFO L93 Difference]: Finished difference Result 917 states and 1373 transitions. [2025-03-17 10:18:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:36,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2025-03-17 10:18:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:36,084 INFO L225 Difference]: With dead ends: 917 [2025-03-17 10:18:36,084 INFO L226 Difference]: Without dead ends: 832 [2025-03-17 10:18:36,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:18:36,085 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 585 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:36,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1550 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 255 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-17 10:18:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-17 10:18:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 771. [2025-03-17 10:18:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 732 states have (on average 1.4904371584699454) internal successors, (1091), 739 states have internal predecessors, (1091), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (38), 25 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-17 10:18:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1158 transitions. [2025-03-17 10:18:36,116 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1158 transitions. Word has length 86 [2025-03-17 10:18:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:36,116 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1158 transitions. [2025-03-17 10:18:36,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1158 transitions. [2025-03-17 10:18:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 10:18:36,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:36,118 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:36,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:18:36,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:36,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:36,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1310713188, now seen corresponding path program 1 times [2025-03-17 10:18:36,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:36,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976813297] [2025-03-17 10:18:36,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:36,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:36,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 10:18:36,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 10:18:36,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:36,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-17 10:18:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:36,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976813297] [2025-03-17 10:18:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976813297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:36,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:36,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:18:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944047152] [2025-03-17 10:18:36,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:36,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:18:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:36,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:18:36,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:18:36,760 INFO L87 Difference]: Start difference. First operand 771 states and 1158 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:37,007 INFO L93 Difference]: Finished difference Result 1301 states and 1983 transitions. [2025-03-17 10:18:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:18:37,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2025-03-17 10:18:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:37,018 INFO L225 Difference]: With dead ends: 1301 [2025-03-17 10:18:37,018 INFO L226 Difference]: Without dead ends: 783 [2025-03-17 10:18:37,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:18:37,020 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 0 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:37,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1684 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:18:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-17 10:18:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 775. [2025-03-17 10:18:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 736 states have (on average 1.4877717391304348) internal successors, (1095), 743 states have internal predecessors, (1095), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (38), 25 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-17 10:18:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1162 transitions. [2025-03-17 10:18:37,048 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1162 transitions. Word has length 86 [2025-03-17 10:18:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:37,048 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1162 transitions. [2025-03-17 10:18:37,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1162 transitions. [2025-03-17 10:18:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 10:18:37,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:37,049 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:37,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:18:37,049 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:37,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash -744581334, now seen corresponding path program 1 times [2025-03-17 10:18:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:37,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573721343] [2025-03-17 10:18:37,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:37,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:37,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 10:18:37,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:18:37,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:37,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-17 10:18:37,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:37,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573721343] [2025-03-17 10:18:37,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573721343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:37,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:37,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:37,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687808497] [2025-03-17 10:18:37,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:37,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:37,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:37,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:37,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:37,772 INFO L87 Difference]: Start difference. First operand 775 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:37,890 INFO L93 Difference]: Finished difference Result 898 states and 1342 transitions. [2025-03-17 10:18:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:37,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 89 [2025-03-17 10:18:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:37,894 INFO L225 Difference]: With dead ends: 898 [2025-03-17 10:18:37,894 INFO L226 Difference]: Without dead ends: 777 [2025-03-17 10:18:37,895 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-03-17 10:18:37,895 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 0 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:37,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 851 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-17 10:18:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2025-03-17 10:18:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 738 states have (on average 1.486449864498645) internal successors, (1097), 745 states have internal predecessors, (1097), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (38), 25 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-17 10:18:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1164 transitions. [2025-03-17 10:18:37,919 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1164 transitions. Word has length 89 [2025-03-17 10:18:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:37,920 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1164 transitions. [2025-03-17 10:18:37,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1164 transitions. [2025-03-17 10:18:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 10:18:37,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:37,921 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:37,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:18:37,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:37,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash 276906603, now seen corresponding path program 1 times [2025-03-17 10:18:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574920556] [2025-03-17 10:18:37,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:38,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 10:18:38,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:18:38,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:38,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-17 10:18:38,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:38,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574920556] [2025-03-17 10:18:38,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574920556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:38,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:38,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51817937] [2025-03-17 10:18:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:38,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:38,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:38,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:38,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:38,664 INFO L87 Difference]: Start difference. First operand 777 states and 1164 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:18:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:38,822 INFO L93 Difference]: Finished difference Result 904 states and 1349 transitions. [2025-03-17 10:18:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 89 [2025-03-17 10:18:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:38,825 INFO L225 Difference]: With dead ends: 904 [2025-03-17 10:18:38,826 INFO L226 Difference]: Without dead ends: 775 [2025-03-17 10:18:38,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:38,832 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 197 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:38,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 624 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-17 10:18:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 771. [2025-03-17 10:18:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 732 states have (on average 1.4795081967213115) internal successors, (1083), 739 states have internal predecessors, (1083), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (38), 25 states have call predecessors, (38), 25 states have call successors, (38) [2025-03-17 10:18:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1150 transitions. [2025-03-17 10:18:38,877 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1150 transitions. Word has length 89 [2025-03-17 10:18:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:38,878 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1150 transitions. [2025-03-17 10:18:38,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 10:18:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1150 transitions. [2025-03-17 10:18:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 10:18:38,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:38,879 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:38,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:18:38,879 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:38,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:38,880 INFO L85 PathProgramCache]: Analyzing trace with hash 374723675, now seen corresponding path program 1 times [2025-03-17 10:18:38,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:38,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272006121] [2025-03-17 10:18:38,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:38,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:39,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 10:18:39,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 10:18:39,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:39,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:40,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272006121] [2025-03-17 10:18:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272006121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:18:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144328354] [2025-03-17 10:18:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:40,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:18:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:40,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:18:40,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:40,028 INFO L87 Difference]: Start difference. First operand 771 states and 1150 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:44,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:48,056 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-03-17 10:18:52,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-03-17 10:18:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:53,029 INFO L93 Difference]: Finished difference Result 878 states and 1299 transitions. [2025-03-17 10:18:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90 [2025-03-17 10:18:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:53,033 INFO L225 Difference]: With dead ends: 878 [2025-03-17 10:18:53,033 INFO L226 Difference]: Without dead ends: 790 [2025-03-17 10:18:53,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:53,033 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 113 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:53,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1872 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 336 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2025-03-17 10:18:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-17 10:18:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 764. [2025-03-17 10:18:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 726 states have (on average 1.4793388429752066) internal successors, (1074), 732 states have internal predecessors, (1074), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (36), 25 states have call predecessors, (36), 24 states have call successors, (36) [2025-03-17 10:18:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1138 transitions. [2025-03-17 10:18:53,052 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1138 transitions. Word has length 90 [2025-03-17 10:18:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:53,052 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1138 transitions. [2025-03-17 10:18:53,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 10:18:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1138 transitions. [2025-03-17 10:18:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 10:18:53,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:53,054 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:53,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:18:53,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-17 10:18:53,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2139322306, now seen corresponding path program 1 times [2025-03-17 10:18:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499454016] [2025-03-17 10:18:53,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:53,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 10:18:53,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 10:18:53,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:53,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499454016] [2025-03-17 10:18:54,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499454016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:18:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448206204] [2025-03-17 10:18:54,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:54,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:18:54,361 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:18:54,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:18:55,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 10:18:55,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 10:18:55,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:55,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:55,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 2226 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 10:18:55,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:18:55,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 10:18:56,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 10:18:56,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 10:18:56,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 10:18:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:56,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:18:56,176 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_#Ultimate.C_memset_#ptr.base_9| Int) (v_ArrVal_8798 (Array Int Int))) (or (< 0 (select (select (store |c_#memory_$Pointer$.base| |v_#Ultimate.C_memset_#ptr.base_9| v_ArrVal_8798) |c_ULTIMATE.start___main_~argv#1.base|) |c_ULTIMATE.start___main_~argv#1.offset|)) (< |v_#Ultimate.C_memset_#ptr.base_9| |c_ULTIMATE.start___main_~#totals~0#1.base|))) is different from false [2025-03-17 10:18:56,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448206204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:18:56,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 10:18:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-03-17 10:18:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664266530] [2025-03-17 10:18:56,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 10:18:56,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 10:18:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:56,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 10:18:56,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2025-03-17 10:18:56,179 INFO L87 Difference]: Start difference. First operand 764 states and 1138 transitions. Second operand has 16 states, 16 states have (on average 9.125) internal successors, (146), 16 states have internal predecessors, (146), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 10:19:00,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:19:04,217 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-03-17 10:19:08,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:19:12,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:19:16,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:19:20,326 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-03-17 10:19:24,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:19:28,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []