./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/wc-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-551b009-m [2025-01-09 20:36:48,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:36:48,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 20:36:48,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:36:48,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:36:48,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:36:48,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:36:48,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:36:48,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:36:48,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:36:48,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:36:48,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:36:48,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:36:48,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:36:48,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:36:48,635 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:36:48,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:36:48,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:36:48,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:36:48,636 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-01-09 20:36:48,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:36:48,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:36:48,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:36:48,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:36:48,880 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:36:48,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-01-09 20:36:50,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af97746cb/c0cbe39a88c3425e8e05ed7a7998b03d/FLAG1dcdf649a [2025-01-09 20:36:50,458 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:36:50,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i [2025-01-09 20:36:50,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af97746cb/c0cbe39a88c3425e8e05ed7a7998b03d/FLAG1dcdf649a [2025-01-09 20:36:50,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af97746cb/c0cbe39a88c3425e8e05ed7a7998b03d [2025-01-09 20:36:50,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:36:50,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:36:50,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:36:50,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:36:50,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:36:50,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:36:50" (1/1) ... [2025-01-09 20:36:50,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd4485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:50, skipping insertion in model container [2025-01-09 20:36:50,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:36:50" (1/1) ... [2025-01-09 20:36:50,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:36:51,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-01-09 20:36:51,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:36:51,389 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:36:51,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-2.i[112480,112493] [2025-01-09 20:36:51,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:36:51,650 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-09 20:36:51,655 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:36:51,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51 WrapperNode [2025-01-09 20:36:51,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:36:51,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:36:51,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:36:51,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:36:51,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,789 INFO L138 Inliner]: procedures = 577, calls = 806, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 2104 [2025-01-09 20:36:51,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:36:51,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:36:51,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:36:51,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:36:51,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,819 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 20:36:51,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:36:51,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:36:51,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:36:51,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:36:51,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (1/1) ... [2025-01-09 20:36:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:36:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:36:51,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:36:51,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:36:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:36:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-09 20:36:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-09 20:36:52,002 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-09 20:36:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 20:36:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 20:36:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:36:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:36:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 20:36:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:36:52,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:36:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-09 20:36:52,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-09 20:36:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-01-09 20:36:52,003 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-01-09 20:36:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-09 20:36:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-09 20:36:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-01-09 20:36:52,003 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-01-09 20:36:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-01-09 20:36:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-01-09 20:36:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 20:36:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 20:36:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:36:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 20:36:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 20:36:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 20:36:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-09 20:36:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-09 20:36:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 20:36:52,335 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:36:52,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:36:58,289 INFO L? ?]: Removed 578 outVars from TransFormulas that were not future-live. [2025-01-09 20:36:58,289 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:36:58,303 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:36:58,303 INFO L312 CfgBuilder]: Removed 29 assume(true) statements. [2025-01-09 20:36:58,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:36:58 BoogieIcfgContainer [2025-01-09 20:36:58,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:36:58,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:36:58,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:36:58,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:36:58,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:36:50" (1/3) ... [2025-01-09 20:36:58,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3869a7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:36:58, skipping insertion in model container [2025-01-09 20:36:58,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:36:51" (2/3) ... [2025-01-09 20:36:58,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3869a7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:36:58, skipping insertion in model container [2025-01-09 20:36:58,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:36:58" (3/3) ... [2025-01-09 20:36:58,311 INFO L128 eAbstractionObserver]: Analyzing ICFG wc-2.i [2025-01-09 20:36:58,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:36:58,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wc-2.i that has 8 procedures, 457 locations, 1 initial locations, 33 loop locations, and 4 error locations. [2025-01-09 20:36:58,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:36:58,373 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;@6da14216, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:36:58,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 20:36:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 423 states have (on average 1.58628841607565) internal successors, (671), 429 states have internal predecessors, (671), 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-01-09 20:36:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 20:36:58,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:36:58,384 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] [2025-01-09 20:36:58,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:36:58,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:36:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1069336587, now seen corresponding path program 1 times [2025-01-09 20:36:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:36:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682050703] [2025-01-09 20:36:58,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:36:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:36:58,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 20:36:58,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 20:36:58,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:36:58,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:36:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:36:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:36:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682050703] [2025-01-09 20:36:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682050703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:36:59,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:36:59,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:36:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474556503] [2025-01-09 20:36:59,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:36:59,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:36:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:36:59,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:36:59,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:36:59,341 INFO L87 Difference]: Start difference. First operand has 457 states, 423 states have (on average 1.58628841607565) internal successors, (671), 429 states have internal predecessors, (671), 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.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-09 20:36:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:36:59,402 INFO L93 Difference]: Finished difference Result 860 states and 1363 transitions. [2025-01-09 20:36:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:36:59,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 44 [2025-01-09 20:36:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:36:59,410 INFO L225 Difference]: With dead ends: 860 [2025-01-09 20:36:59,411 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 20:36:59,414 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-01-09 20:36:59,416 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 0 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:36:59,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1200 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:36:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 20:36:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-01-09 20:36:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 378 states have (on average 1.5105820105820107) internal successors, (571), 385 states have internal predecessors, (571), 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-01-09 20:36:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 602 transitions. [2025-01-09 20:36:59,468 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 602 transitions. Word has length 44 [2025-01-09 20:36:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:36:59,469 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 602 transitions. [2025-01-09 20:36:59,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-09 20:36:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 602 transitions. [2025-01-09 20:36:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 20:36:59,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:36:59,471 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, 1] [2025-01-09 20:36:59,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:36:59,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:36:59,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:36:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1278310548, now seen corresponding path program 1 times [2025-01-09 20:36:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:36:59,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719154209] [2025-01-09 20:36:59,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:36:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:36:59,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 20:36:59,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 20:36:59,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:36:59,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:37:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719154209] [2025-01-09 20:37:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719154209] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:37:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631573424] [2025-01-09 20:37:00,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:00,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:37:00,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:37:00,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:37:00,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:37:00,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 20:37:00,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 20:37:00,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:00,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:00,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:37:00,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:37:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:37:00,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:37:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:37:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631573424] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:37:00,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:37:00,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 20:37:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73126864] [2025-01-09 20:37:00,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:37:00,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:37:00,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:00,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:37:00,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:37:00,957 INFO L87 Difference]: Start difference. First operand 405 states and 602 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-01-09 20:37:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:00,994 INFO L93 Difference]: Finished difference Result 809 states and 1205 transitions. [2025-01-09 20:37:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:37:00,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 48 [2025-01-09 20:37:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:00,997 INFO L225 Difference]: With dead ends: 809 [2025-01-09 20:37:00,997 INFO L226 Difference]: Without dead ends: 408 [2025-01-09 20:37:00,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:37:00,999 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 0 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:00,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1796 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-09 20:37:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-01-09 20:37:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 381 states have (on average 1.5065616797900263) internal successors, (574), 388 states have internal predecessors, (574), 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-01-09 20:37:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 605 transitions. [2025-01-09 20:37:01,016 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 605 transitions. Word has length 48 [2025-01-09 20:37:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:01,016 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 605 transitions. [2025-01-09 20:37:01,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-01-09 20:37:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 605 transitions. [2025-01-09 20:37:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 20:37:01,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:01,018 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, 1] [2025-01-09 20:37:01,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:37:01,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:37:01,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:01,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1174421575, now seen corresponding path program 2 times [2025-01-09 20:37:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010631996] [2025-01-09 20:37:01,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:37:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:01,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-01-09 20:37:01,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 51 statements. [2025-01-09 20:37:01,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:37:01,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 20:37:01,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:01,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010631996] [2025-01-09 20:37:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010631996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:01,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:01,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:37:01,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883354662] [2025-01-09 20:37:01,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:01,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:37:01,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:01,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:37:01,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:37:01,833 INFO L87 Difference]: Start difference. First operand 408 states and 605 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-01-09 20:37:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:02,028 INFO L93 Difference]: Finished difference Result 930 states and 1399 transitions. [2025-01-09 20:37:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:37:02,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 51 [2025-01-09 20:37:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:02,031 INFO L225 Difference]: With dead ends: 930 [2025-01-09 20:37:02,031 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 20:37:02,032 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-01-09 20:37:02,032 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1155 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:02,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1135 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:37:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 20:37:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 409. [2025-01-09 20:37:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 382 states have (on average 1.5052356020942408) internal successors, (575), 389 states have internal predecessors, (575), 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-01-09 20:37:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 606 transitions. [2025-01-09 20:37:02,056 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 606 transitions. Word has length 51 [2025-01-09 20:37:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:02,056 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 606 transitions. [2025-01-09 20:37:02,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-01-09 20:37:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 606 transitions. [2025-01-09 20:37:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 20:37:02,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:02,058 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, 1] [2025-01-09 20:37:02,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:37:02,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:02,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1532197819, now seen corresponding path program 1 times [2025-01-09 20:37:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959218018] [2025-01-09 20:37:02,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:02,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 20:37:02,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 20:37:02,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:02,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 20:37:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:02,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959218018] [2025-01-09 20:37:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959218018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:37:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561620752] [2025-01-09 20:37:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:02,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:37:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:02,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:37:02,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:37:02,608 INFO L87 Difference]: Start difference. First operand 409 states and 606 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-01-09 20:37:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:02,703 INFO L93 Difference]: Finished difference Result 422 states and 618 transitions. [2025-01-09 20:37:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:37:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 51 [2025-01-09 20:37:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:02,712 INFO L225 Difference]: With dead ends: 422 [2025-01-09 20:37:02,712 INFO L226 Difference]: Without dead ends: 417 [2025-01-09 20:37:02,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:37:02,712 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 13 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2980 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:02,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2980 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:37:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-01-09 20:37:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2025-01-09 20:37:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 386 states have (on average 1.5) internal successors, (579), 392 states have internal predecessors, (579), 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-01-09 20:37:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 611 transitions. [2025-01-09 20:37:02,740 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 611 transitions. Word has length 51 [2025-01-09 20:37:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:02,740 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 611 transitions. [2025-01-09 20:37:02,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-01-09 20:37:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 611 transitions. [2025-01-09 20:37:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 20:37:02,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:02,742 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, 1] [2025-01-09 20:37:02,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:37:02,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:02,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1532199741, now seen corresponding path program 1 times [2025-01-09 20:37:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417360530] [2025-01-09 20:37:02,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:03,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 20:37:03,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 20:37:03,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:03,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:37:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417360530] [2025-01-09 20:37:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417360530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:37:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768092467] [2025-01-09 20:37:03,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:03,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:37:03,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:37:03,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:37:03,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:37:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 20:37:04,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 20:37:04,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:04,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:04,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:37:04,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:37:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:37:04,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:37:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:37:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768092467] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:37:04,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:37:04,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 20:37:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372149490] [2025-01-09 20:37:04,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:37:04,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 20:37:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:04,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 20:37:04,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:37:04,223 INFO L87 Difference]: Start difference. First operand 414 states and 611 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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-01-09 20:37:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:04,262 INFO L93 Difference]: Finished difference Result 827 states and 1226 transitions. [2025-01-09 20:37:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 20:37:04,263 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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 51 [2025-01-09 20:37:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:04,264 INFO L225 Difference]: With dead ends: 827 [2025-01-09 20:37:04,264 INFO L226 Difference]: Without dead ends: 420 [2025-01-09 20:37:04,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 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-01-09 20:37:04,266 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 0 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:04,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1796 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-01-09 20:37:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-01-09 20:37:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 392 states have (on average 1.4923469387755102) internal successors, (585), 398 states have internal predecessors, (585), 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-01-09 20:37:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 617 transitions. [2025-01-09 20:37:04,276 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 617 transitions. Word has length 51 [2025-01-09 20:37:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:04,277 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 617 transitions. [2025-01-09 20:37:04,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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-01-09 20:37:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 617 transitions. [2025-01-09 20:37:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 20:37:04,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:04,278 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] [2025-01-09 20:37:04,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:37:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:37:04,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1847608669, now seen corresponding path program 2 times [2025-01-09 20:37:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:04,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88916282] [2025-01-09 20:37:04,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:37:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:04,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-01-09 20:37:04,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 57 statements. [2025-01-09 20:37:04,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:37:04,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88916282] [2025-01-09 20:37:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88916282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:04,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:04,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:37:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271167559] [2025-01-09 20:37:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:04,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:37:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:04,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:37:04,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:37:04,944 INFO L87 Difference]: Start difference. First operand 420 states and 617 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-01-09 20:37:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:04,966 INFO L93 Difference]: Finished difference Result 808 states and 1186 transitions. [2025-01-09 20:37:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:37:04,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 57 [2025-01-09 20:37:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:04,968 INFO L225 Difference]: With dead ends: 808 [2025-01-09 20:37:04,968 INFO L226 Difference]: Without dead ends: 424 [2025-01-09 20:37:04,969 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-01-09 20:37:04,970 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 21 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:04,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1170 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-09 20:37:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-01-09 20:37:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 395 states have (on average 1.4860759493670885) internal successors, (587), 401 states have internal predecessors, (587), 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-01-09 20:37:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 619 transitions. [2025-01-09 20:37:04,980 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 619 transitions. Word has length 57 [2025-01-09 20:37:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:04,981 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 619 transitions. [2025-01-09 20:37:04,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-01-09 20:37:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 619 transitions. [2025-01-09 20:37:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:37:04,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:04,982 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] [2025-01-09 20:37:04,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:37:04,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:04,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1161987373, now seen corresponding path program 1 times [2025-01-09 20:37:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:04,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903340709] [2025-01-09 20:37:04,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:05,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:37:05,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:37:05,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:05,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:05,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903340709] [2025-01-09 20:37:05,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903340709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:05,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:05,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:37:05,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702353994] [2025-01-09 20:37:05,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:05,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:37:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:05,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:37:05,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:37:05,458 INFO L87 Difference]: Start difference. First operand 424 states and 619 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-01-09 20:37:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:05,492 INFO L93 Difference]: Finished difference Result 823 states and 1208 transitions. [2025-01-09 20:37:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:37:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 65 [2025-01-09 20:37:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:05,494 INFO L225 Difference]: With dead ends: 823 [2025-01-09 20:37:05,494 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 20:37:05,495 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-01-09 20:37:05,495 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 0 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:05,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1780 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 20:37:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-01-09 20:37:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 397 states have (on average 1.4836272040302267) internal successors, (589), 403 states have internal predecessors, (589), 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-01-09 20:37:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 621 transitions. [2025-01-09 20:37:05,514 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 621 transitions. Word has length 65 [2025-01-09 20:37:05,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:05,514 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 621 transitions. [2025-01-09 20:37:05,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-01-09 20:37:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 621 transitions. [2025-01-09 20:37:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:37:05,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:05,515 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] [2025-01-09 20:37:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:37:05,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:05,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:05,515 INFO L85 PathProgramCache]: Analyzing trace with hash -887400469, now seen corresponding path program 1 times [2025-01-09 20:37:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939055007] [2025-01-09 20:37:05,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:05,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:37:05,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:37:05,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:06,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:06,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939055007] [2025-01-09 20:37:06,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939055007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:06,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:37:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346002222] [2025-01-09 20:37:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:06,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:37:06,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:06,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:37:06,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:37:06,109 INFO L87 Difference]: Start difference. First operand 426 states and 621 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-01-09 20:37:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:06,173 INFO L93 Difference]: Finished difference Result 825 states and 1210 transitions. [2025-01-09 20:37:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:37:06,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2025-01-09 20:37:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:06,175 INFO L225 Difference]: With dead ends: 825 [2025-01-09 20:37:06,176 INFO L226 Difference]: Without dead ends: 429 [2025-01-09 20:37:06,177 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-01-09 20:37:06,177 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:06,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2950 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-01-09 20:37:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-01-09 20:37:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 400 states have (on average 1.48) internal successors, (592), 406 states have internal predecessors, (592), 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-01-09 20:37:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 624 transitions. [2025-01-09 20:37:06,193 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 624 transitions. Word has length 65 [2025-01-09 20:37:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:06,193 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 624 transitions. [2025-01-09 20:37:06,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-01-09 20:37:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 624 transitions. [2025-01-09 20:37:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:37:06,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:06,195 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] [2025-01-09 20:37:06,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:37:06,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:06,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash -791444174, now seen corresponding path program 1 times [2025-01-09 20:37:06,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:06,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41248400] [2025-01-09 20:37:06,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:06,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:37:06,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:37:06,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:06,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41248400] [2025-01-09 20:37:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41248400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:06,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:37:06,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200229164] [2025-01-09 20:37:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:06,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:37:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:06,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:37:06,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:37:06,659 INFO L87 Difference]: Start difference. First operand 429 states and 624 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-09 20:37:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:06,695 INFO L93 Difference]: Finished difference Result 825 states and 1208 transitions. [2025-01-09 20:37:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:37:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 67 [2025-01-09 20:37:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:06,699 INFO L225 Difference]: With dead ends: 825 [2025-01-09 20:37:06,699 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 20:37:06,700 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-01-09 20:37:06,701 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 0 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:06,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1780 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 20:37:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-01-09 20:37:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 402 states have (on average 1.4776119402985075) internal successors, (594), 408 states have internal predecessors, (594), 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-01-09 20:37:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 626 transitions. [2025-01-09 20:37:06,714 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 626 transitions. Word has length 67 [2025-01-09 20:37:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:06,715 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 626 transitions. [2025-01-09 20:37:06,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-09 20:37:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 626 transitions. [2025-01-09 20:37:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:37:06,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:06,716 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] [2025-01-09 20:37:06,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:37:06,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:06,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1688837452, now seen corresponding path program 1 times [2025-01-09 20:37:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655599330] [2025-01-09 20:37:06,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:06,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:37:06,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:37:06,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:06,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655599330] [2025-01-09 20:37:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655599330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:07,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:07,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:37:07,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21028637] [2025-01-09 20:37:07,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:07,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:37:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:07,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:37:07,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:37:07,201 INFO L87 Difference]: Start difference. First operand 431 states and 626 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-01-09 20:37:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:07,258 INFO L93 Difference]: Finished difference Result 829 states and 1213 transitions. [2025-01-09 20:37:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:37:07,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 67 [2025-01-09 20:37:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:07,260 INFO L225 Difference]: With dead ends: 829 [2025-01-09 20:37:07,260 INFO L226 Difference]: Without dead ends: 433 [2025-01-09 20:37:07,261 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-01-09 20:37:07,261 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 0 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:07,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2379 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-09 20:37:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2025-01-09 20:37:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 401 states have (on average 1.4763092269326683) internal successors, (592), 407 states have internal predecessors, (592), 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-01-09 20:37:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 624 transitions. [2025-01-09 20:37:07,273 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 624 transitions. Word has length 67 [2025-01-09 20:37:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:07,273 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 624 transitions. [2025-01-09 20:37:07,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-01-09 20:37:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 624 transitions. [2025-01-09 20:37:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:37:07,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:07,274 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] [2025-01-09 20:37:07,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:37:07,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:07,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749779, now seen corresponding path program 1 times [2025-01-09 20:37:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984616002] [2025-01-09 20:37:07,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:07,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:37:07,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:37:07,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:07,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984616002] [2025-01-09 20:37:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984616002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:37:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305513427] [2025-01-09 20:37:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:07,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:37:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:37:07,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:37:07,727 INFO L87 Difference]: Start difference. First operand 430 states and 624 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-01-09 20:37:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:07,749 INFO L93 Difference]: Finished difference Result 816 states and 1193 transitions. [2025-01-09 20:37:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:37:07,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 69 [2025-01-09 20:37:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:07,751 INFO L225 Difference]: With dead ends: 816 [2025-01-09 20:37:07,751 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 20:37:07,751 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-01-09 20:37:07,752 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:07,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 20:37:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-01-09 20:37:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 402 states have (on average 1.4751243781094527) internal successors, (593), 408 states have internal predecessors, (593), 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-01-09 20:37:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 625 transitions. [2025-01-09 20:37:07,761 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 625 transitions. Word has length 69 [2025-01-09 20:37:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:07,762 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 625 transitions. [2025-01-09 20:37:07,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-01-09 20:37:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 625 transitions. [2025-01-09 20:37:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:37:07,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:07,764 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] [2025-01-09 20:37:07,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:37:07,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:07,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash -240390481, now seen corresponding path program 1 times [2025-01-09 20:37:07,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:07,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42252258] [2025-01-09 20:37:07,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:08,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:37:08,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:37:08,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:08,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:08,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42252258] [2025-01-09 20:37:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42252258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:08,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:37:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088014341] [2025-01-09 20:37:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:08,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:37:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:08,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:37:08,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:37:08,209 INFO L87 Difference]: Start difference. First operand 431 states and 625 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-01-09 20:37:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:08,229 INFO L93 Difference]: Finished difference Result 688 states and 1003 transitions. [2025-01-09 20:37:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:37:08,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 69 [2025-01-09 20:37:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:08,232 INFO L225 Difference]: With dead ends: 688 [2025-01-09 20:37:08,232 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 20:37:08,232 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-01-09 20:37:08,233 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:08,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 974 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 20:37:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-01-09 20:37:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 329 states have (on average 1.4559270516717324) internal successors, (479), 335 states have internal predecessors, (479), 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-01-09 20:37:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 509 transitions. [2025-01-09 20:37:08,241 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 509 transitions. Word has length 69 [2025-01-09 20:37:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:08,241 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 509 transitions. [2025-01-09 20:37:08,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-01-09 20:37:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 509 transitions. [2025-01-09 20:37:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 20:37:08,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:08,242 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, 1] [2025-01-09 20:37:08,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:37:08,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:08,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash 572061690, now seen corresponding path program 1 times [2025-01-09 20:37:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:08,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409157883] [2025-01-09 20:37:08,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:08,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 20:37:08,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 20:37:08,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:08,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409157883] [2025-01-09 20:37:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409157883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:08,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:08,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:37:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71344160] [2025-01-09 20:37:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:08,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:37:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:08,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:37:08,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:37:08,670 INFO L87 Difference]: Start difference. First operand 356 states and 509 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-01-09 20:37:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:08,695 INFO L93 Difference]: Finished difference Result 608 states and 879 transitions. [2025-01-09 20:37:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:37:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 74 [2025-01-09 20:37:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:08,697 INFO L225 Difference]: With dead ends: 608 [2025-01-09 20:37:08,697 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 20:37:08,698 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-01-09 20:37:08,698 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:08,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 972 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 20:37:08,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-01-09 20:37:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 330 states have (on average 1.4545454545454546) internal successors, (480), 336 states have internal predecessors, (480), 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-01-09 20:37:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 510 transitions. [2025-01-09 20:37:08,709 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 510 transitions. Word has length 74 [2025-01-09 20:37:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:08,709 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 510 transitions. [2025-01-09 20:37:08,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-01-09 20:37:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 510 transitions. [2025-01-09 20:37:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 20:37:08,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:08,710 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, 1, 1] [2025-01-09 20:37:08,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:37:08,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:08,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1612823097, now seen corresponding path program 1 times [2025-01-09 20:37:08,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:08,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498837938] [2025-01-09 20:37:08,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:08,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:09,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 20:37:09,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 20:37:09,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:09,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:09,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498837938] [2025-01-09 20:37:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498837938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:37:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559522764] [2025-01-09 20:37:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:09,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:37:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:09,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:37:09,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:37:09,156 INFO L87 Difference]: Start difference. First operand 357 states and 510 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-01-09 20:37:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:09,168 INFO L93 Difference]: Finished difference Result 590 states and 852 transitions. [2025-01-09 20:37:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:37:09,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 75 [2025-01-09 20:37:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:09,170 INFO L225 Difference]: With dead ends: 590 [2025-01-09 20:37:09,171 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 20:37:09,171 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-01-09 20:37:09,172 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 237 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:09,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 657 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 20:37:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-01-09 20:37:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 312 states have (on average 1.4487179487179487) internal successors, (452), 318 states have internal predecessors, (452), 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-01-09 20:37:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 478 transitions. [2025-01-09 20:37:09,181 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 478 transitions. Word has length 75 [2025-01-09 20:37:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:09,181 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 478 transitions. [2025-01-09 20:37:09,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-01-09 20:37:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 478 transitions. [2025-01-09 20:37:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 20:37:09,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:09,184 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] [2025-01-09 20:37:09,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:37:09,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:09,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash -549499590, now seen corresponding path program 1 times [2025-01-09 20:37:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:09,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686025762] [2025-01-09 20:37:09,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:09,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 20:37:09,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 20:37:09,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:09,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:09,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:09,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686025762] [2025-01-09 20:37:09,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686025762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:09,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:09,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:37:09,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311244167] [2025-01-09 20:37:09,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:09,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:37:09,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:09,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:37:09,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:37:09,966 INFO L87 Difference]: Start difference. First operand 336 states and 478 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-01-09 20:37:13,989 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-01-09 20:37:18,001 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-01-09 20:37:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:18,361 INFO L93 Difference]: Finished difference Result 498 states and 719 transitions. [2025-01-09 20:37:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:37:18,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 88 [2025-01-09 20:37:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:18,364 INFO L225 Difference]: With dead ends: 498 [2025-01-09 20:37:18,364 INFO L226 Difference]: Without dead ends: 411 [2025-01-09 20:37:18,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:37:18,365 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 522 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:18,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1884 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 210 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-01-09 20:37:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-09 20:37:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 349. [2025-01-09 20:37:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 323 states have (on average 1.4458204334365325) internal successors, (467), 330 states have internal predecessors, (467), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-01-09 20:37:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 501 transitions. [2025-01-09 20:37:18,375 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 501 transitions. Word has length 88 [2025-01-09 20:37:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:18,375 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 501 transitions. [2025-01-09 20:37:18,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-01-09 20:37:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 501 transitions. [2025-01-09 20:37:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 20:37:18,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:18,376 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] [2025-01-09 20:37:18,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:37:18,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:18,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:18,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1136305604, now seen corresponding path program 1 times [2025-01-09 20:37:18,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:18,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396915601] [2025-01-09 20:37:18,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:18,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:18,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 20:37:18,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 20:37:18,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:18,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 20:37:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396915601] [2025-01-09 20:37:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396915601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:18,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:18,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:37:18,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545960532] [2025-01-09 20:37:18,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:18,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:37:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:18,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:37:18,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:37:18,869 INFO L87 Difference]: Start difference. First operand 349 states and 501 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-01-09 20:37:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:18,936 INFO L93 Difference]: Finished difference Result 597 states and 867 transitions. [2025-01-09 20:37:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:37:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 88 [2025-01-09 20:37:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:18,940 INFO L225 Difference]: With dead ends: 597 [2025-01-09 20:37:18,940 INFO L226 Difference]: Without dead ends: 352 [2025-01-09 20:37:18,940 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-01-09 20:37:18,941 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:18,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1804 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:37:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-09 20:37:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-01-09 20:37:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 326 states have (on average 1.4417177914110428) internal successors, (470), 333 states have internal predecessors, (470), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-01-09 20:37:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 504 transitions. [2025-01-09 20:37:18,952 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 504 transitions. Word has length 88 [2025-01-09 20:37:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:18,953 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 504 transitions. [2025-01-09 20:37:18,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-01-09 20:37:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 504 transitions. [2025-01-09 20:37:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:37:18,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:18,955 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-01-09 20:37:18,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:37:18,956 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:18,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash 401562478, now seen corresponding path program 1 times [2025-01-09 20:37:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:18,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339133673] [2025-01-09 20:37:18,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:18,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:19,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:37:19,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:37:19,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:19,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 20:37:19,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:19,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339133673] [2025-01-09 20:37:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339133673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:19,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:19,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:37:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333158412] [2025-01-09 20:37:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:19,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:37:19,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:19,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:37:19,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:37:19,413 INFO L87 Difference]: Start difference. First operand 352 states and 504 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-01-09 20:37:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:19,432 INFO L93 Difference]: Finished difference Result 472 states and 677 transitions. [2025-01-09 20:37:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:37:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 90 [2025-01-09 20:37:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:19,434 INFO L225 Difference]: With dead ends: 472 [2025-01-09 20:37:19,434 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 20:37:19,435 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-01-09 20:37:19,435 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 0 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:19,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 910 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 20:37:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-01-09 20:37:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 327 states have (on average 1.4403669724770642) internal successors, (471), 334 states have internal predecessors, (471), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-01-09 20:37:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 505 transitions. [2025-01-09 20:37:19,445 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 505 transitions. Word has length 90 [2025-01-09 20:37:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:19,446 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 505 transitions. [2025-01-09 20:37:19,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-01-09 20:37:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 505 transitions. [2025-01-09 20:37:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:37:19,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:19,447 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-01-09 20:37:19,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:37:19,447 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:19,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash 331988367, now seen corresponding path program 1 times [2025-01-09 20:37:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:19,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023904621] [2025-01-09 20:37:19,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:19,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:37:19,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:37:19,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:19,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 20:37:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023904621] [2025-01-09 20:37:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023904621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:37:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198362965] [2025-01-09 20:37:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:37:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:19,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:37:19,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:37:19,931 INFO L87 Difference]: Start difference. First operand 353 states and 505 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-01-09 20:37:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:19,952 INFO L93 Difference]: Finished difference Result 477 states and 683 transitions. [2025-01-09 20:37:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:37:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 90 [2025-01-09 20:37:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:19,955 INFO L225 Difference]: With dead ends: 477 [2025-01-09 20:37:19,955 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 20:37:19,956 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-01-09 20:37:19,956 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 207 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:19,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 662 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:37:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 20:37:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2025-01-09 20:37:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 324 states have (on average 1.4320987654320987) internal successors, (464), 331 states have internal predecessors, (464), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-01-09 20:37:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 498 transitions. [2025-01-09 20:37:19,968 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 498 transitions. Word has length 90 [2025-01-09 20:37:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:19,968 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 498 transitions. [2025-01-09 20:37:19,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-01-09 20:37:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 498 transitions. [2025-01-09 20:37:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 20:37:19,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:19,969 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-01-09 20:37:19,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:37:19,969 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:19,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:19,970 INFO L85 PathProgramCache]: Analyzing trace with hash 87582625, now seen corresponding path program 1 times [2025-01-09 20:37:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:19,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158850542] [2025-01-09 20:37:19,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:20,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 20:37:20,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 20:37:20,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:20,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:20,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:20,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158850542] [2025-01-09 20:37:20,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158850542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:37:20,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:37:20,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:37:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589584303] [2025-01-09 20:37:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:37:20,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:37:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:20,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:37:20,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:37:20,681 INFO L87 Difference]: Start difference. First operand 350 states and 498 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-01-09 20:37:24,704 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-01-09 20:37:28,712 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-01-09 20:37:32,740 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-01-09 20:37:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:37:33,094 INFO L93 Difference]: Finished difference Result 459 states and 649 transitions. [2025-01-09 20:37:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:37:33,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 91 [2025-01-09 20:37:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:37:33,101 INFO L225 Difference]: With dead ends: 459 [2025-01-09 20:37:33,101 INFO L226 Difference]: Without dead ends: 369 [2025-01-09 20:37:33,101 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-01-09 20:37:33,101 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 114 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:37:33,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 2023 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 249 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2025-01-09 20:37:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-09 20:37:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 343. [2025-01-09 20:37:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 318 states have (on average 1.430817610062893) internal successors, (455), 324 states have internal predecessors, (455), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2025-01-09 20:37:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 486 transitions. [2025-01-09 20:37:33,116 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 486 transitions. Word has length 91 [2025-01-09 20:37:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:37:33,116 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 486 transitions. [2025-01-09 20:37:33,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-01-09 20:37:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 486 transitions. [2025-01-09 20:37:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 20:37:33,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:37:33,117 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, 1] [2025-01-09 20:37:33,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:37:33,117 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:37:33,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:37:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash 844796199, now seen corresponding path program 1 times [2025-01-09 20:37:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:37:33,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76643349] [2025-01-09 20:37:33,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:37:33,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 20:37:33,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 20:37:33,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:33,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:37:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76643349] [2025-01-09 20:37:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76643349] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:37:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128099851] [2025-01-09 20:37:34,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:37:34,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:37:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:37:34,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:37:34,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:37:34,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 20:37:35,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 20:37:35,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:37:35,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:37:35,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 2199 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 20:37:35,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:37:35,490 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-01-09 20:37:35,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 20:37:35,590 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-01-09 20:37:35,616 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-01-09 20:37:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:37:35,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:37:35,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_#Ultimate.C_memset_#ptr.base_9| Int) (v_ArrVal_7889 (Array Int Int))) (or (< 0 (select (select (store |c_#memory_$Pointer$.base| |v_#Ultimate.C_memset_#ptr.base_9| v_ArrVal_7889) |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-01-09 20:37:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128099851] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:37:35,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 20:37:35,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-01-09 20:37:35,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287918958] [2025-01-09 20:37:35,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 20:37:35,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 20:37:35,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:37:35,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 20:37:35,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2025-01-09 20:37:35,761 INFO L87 Difference]: Start difference. First operand 343 states and 486 transitions. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-01-09 20:37:39,825 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-01-09 20:37:43,837 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-01-09 20:37:47,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:37:51,885 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-01-09 20:37:55,901 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-01-09 20:37:59,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:38:03,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:38:07,997 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-01-09 20:38:12,018 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-01-09 20:38:16,054 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-01-09 20:38:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:16,981 INFO L93 Difference]: Finished difference Result 508 states and 726 transitions. [2025-01-09 20:38:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:38:16,981 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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) Word has length 92 [2025-01-09 20:38:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:16,983 INFO L225 Difference]: With dead ends: 508 [2025-01-09 20:38:16,983 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 20:38:16,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=408, Unknown=1, NotChecked=42, Total=552 [2025-01-09 20:38:16,986 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 1894 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 126 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:16,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 2520 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 463 Invalid, 10 Unknown, 0 Unchecked, 41.1s Time] [2025-01-09 20:38:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 20:38:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 350. [2025-01-09 20:38:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 324 states have (on average 1.4320987654320987) internal successors, (464), 331 states have internal predecessors, (464), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-01-09 20:38:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 498 transitions. [2025-01-09 20:38:17,001 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 498 transitions. Word has length 92 [2025-01-09 20:38:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:17,002 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 498 transitions. [2025-01-09 20:38:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-01-09 20:38:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 498 transitions. [2025-01-09 20:38:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 20:38:17,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:17,003 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, 1] [2025-01-09 20:38:17,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 20:38:17,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:38:17,204 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:38:17,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -166321051, now seen corresponding path program 1 times [2025-01-09 20:38:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:17,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361165615] [2025-01-09 20:38:17,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:17,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 20:38:17,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 20:38:17,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:17,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:38:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:18,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361165615] [2025-01-09 20:38:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361165615] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:38:18,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731639259] [2025-01-09 20:38:18,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:38:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:38:18,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:38:18,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:38:19,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 20:38:19,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 20:38:19,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:19,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:19,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 20:38:19,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:38:20,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 20:38:20,012 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 26 treesize of output 21 [2025-01-09 20:38:20,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 20:38:20,022 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 26 treesize of output 21 [2025-01-09 20:38:20,066 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 25 treesize of output 17 [2025-01-09 20:38:20,071 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 21 treesize of output 13 [2025-01-09 20:38:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 20:38:20,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:38:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731639259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:38:20,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 20:38:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2025-01-09 20:38:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910438478] [2025-01-09 20:38:20,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 20:38:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 20:38:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:20,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 20:38:20,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=252, Unknown=3, NotChecked=0, Total=306 [2025-01-09 20:38:20,304 INFO L87 Difference]: Start difference. First operand 350 states and 498 transitions. Second operand has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 17 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)