./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/usleep-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/usleep-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 92819ed386f0d70ff4609309e3718a41b6a1b41ff8c4c600c8db8bc7b56921e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:30:19,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:30:19,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:30:19,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:30:19,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:30:19,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:30:19,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:30:19,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:30:19,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:30:19,834 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:30:19,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:30:19,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:30:19,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:30:19,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:30:19,835 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:30:19,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:30:19,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:30:19,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:30:19,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:30:19,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:30:19,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:30:19,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:30:19,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:30:19,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:30:19,837 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 ! overflow) ) 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 -> 92819ed386f0d70ff4609309e3718a41b6a1b41ff8c4c600c8db8bc7b56921e0 [2025-02-08 13:30:20,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:30:20,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:30:20,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:30:20,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:30:20,025 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:30:20,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/usleep-2.i [2025-02-08 13:30:21,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/389c3fcb0/845f2283243541ecb072268f2f498439/FLAG3c607223e [2025-02-08 13:30:21,586 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:30:21,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/usleep-2.i [2025-02-08 13:30:21,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/389c3fcb0/845f2283243541ecb072268f2f498439/FLAG3c607223e [2025-02-08 13:30:21,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/389c3fcb0/845f2283243541ecb072268f2f498439 [2025-02-08 13:30:21,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:30:21,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:30:21,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:30:21,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:30:21,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:30:21,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:30:21" (1/1) ... [2025-02-08 13:30:21,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31940465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:21, skipping insertion in model container [2025-02-08 13:30:21,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:30:21" (1/1) ... [2025-02-08 13:30:21,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:30:22,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:30:22,443 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:30:22,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:30:22,640 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:30:22,650 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:30:22,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22 WrapperNode [2025-02-08 13:30:22,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:30:22,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:30:22,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:30:22,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:30:22,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,754 INFO L138 Inliner]: procedures = 598, calls = 512, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 893 [2025-02-08 13:30:22,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:30:22,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:30:22,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:30:22,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:30:22,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,798 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:30:22,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:30:22,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:30:22,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:30:22,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:30:22,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (1/1) ... [2025-02-08 13:30:22,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:30:22,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:22,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:30:22,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:30:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:30:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:30:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:30:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:30:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:30:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:30:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:30:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:30:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:30:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:30:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:30:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:30:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:30:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:30:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:30:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:30:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:30:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:30:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:30:22,914 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:30:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:30:23,140 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:30:23,142 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:30:23,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2341: bb_verror_msg_#t~ret97#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet103#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret97#1 && bb_verror_msg_#t~ret97#1 <= 2147483647;havoc bb_verror_msg_#t~ret97#1;call bb_verror_msg_#t~mem98#1.base, bb_verror_msg_#t~mem98#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem98#1.base, bb_verror_msg_#t~mem98#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret104#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:30:23,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret105#1, safe_write_#t~mem106#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 13:30:23,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:30:23,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2342: bb_verror_msg_#t~ret99#1 := full_write_#res#1;havoc full_write_#t~ret104#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret99#1 && bb_verror_msg_#t~ret99#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem98#1.base, bb_verror_msg_#t~mem98#1.offset;havoc bb_verror_msg_#t~ret99#1; [2025-02-08 13:30:23,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:30:23,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2367: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet165#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet165#1;assume -9223372036854775808 <= write_#t~nondet165#1 && write_#t~nondet165#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet165#1;havoc write_#t~nondet165#1; [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376: assume !true; [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2360: full_write_#t~ret104#1 := safe_write_#res#1;havoc safe_write_#t~ret105#1, safe_write_#t~mem106#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret104#1 && full_write_#t~ret104#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret104#1;havoc full_write_#t~ret104#1; [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2385-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2559-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2559: write_#res#1 := write_~ret~1#1; [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: assume full_write_~cc~0#1 < 0; [2025-02-08 13:30:23,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:30:23,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2378: safe_write_#t~ret105#1 := write_#res#1;havoc write_#t~nondet165#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret105#1 && safe_write_#t~ret105#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret105#1;havoc safe_write_#t~ret105#1; [2025-02-08 13:30:23,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2379: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem106#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem106#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:30:23,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2379: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:30:23,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2363: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:30:23,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2363: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: havoc xstrtou_range_sfx_~__s1_len~0#1;havoc xstrtou_range_sfx_~__s2_len~0#1;havoc xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;call xstrtou_range_sfx_#t~mem122#1.base, xstrtou_range_sfx_#t~mem122#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1 := xstrtou_range_sfx_#t~nondet123#1;havoc xstrtou_range_sfx_#t~mem122#1.base, xstrtou_range_sfx_#t~mem122#1.offset;havoc xstrtou_range_sfx_#t~nondet123#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2447: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem119#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem119#1.offset);havoc xstrtou_range_sfx_#t~mem119#1.base, xstrtou_range_sfx_#t~mem119#1.offset;call xstrtou_range_sfx_#t~mem120#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2447: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem119#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem119#1.offset);havoc xstrtou_range_sfx_#t~mem119#1.base, xstrtou_range_sfx_#t~mem119#1.offset; [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2472: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2472: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2468: assume 0 == xstrtou_range_sfx_#t~mem127#1;havoc xstrtou_range_sfx_#t~mem126#1.base, xstrtou_range_sfx_#t~mem126#1.offset;havoc xstrtou_range_sfx_#t~mem127#1; [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2468: assume !(0 == xstrtou_range_sfx_#t~mem127#1);havoc xstrtou_range_sfx_#t~mem126#1.base, xstrtou_range_sfx_#t~mem126#1.offset;havoc xstrtou_range_sfx_#t~mem127#1; [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2468-1: call xstrtou_range_sfx_#t~mem126#1.base, xstrtou_range_sfx_#t~mem126#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem127#1 := read~int(xstrtou_range_sfx_#t~mem126#1.base, xstrtou_range_sfx_#t~mem126#1.offset, 1); [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem124#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:30:23,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-1: assume !(0 == xstrtou_range_sfx_#t~mem121#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem121#1; [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-1: assume !!(0 == xstrtou_range_sfx_#t~mem121#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem121#1; [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453: assume true;call xstrtou_range_sfx_#t~mem121#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453: assume !true; [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449: assume 0 == xstrtou_range_sfx_#t~mem120#1;havoc xstrtou_range_sfx_#t~mem120#1;call write~int(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449: assume !(0 == xstrtou_range_sfx_#t~mem120#1);havoc xstrtou_range_sfx_#t~mem120#1; [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~0#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: assume !(4294967295 / (xstrtou_range_sfx_#t~mem124#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem124#1; [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem124#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem124#1;call xstrtou_range_sfx_#t~mem125#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_~r~0#1 * xstrtou_range_sfx_#t~mem125#1;havoc xstrtou_range_sfx_#t~mem125#1; [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-1: SUMMARY for call bb_error_msg_and_die(6, 0, xstrtou_range_sfx_#t~varargs128#1.base, xstrtou_range_sfx_#t~varargs128#1.offset); srcloc: null [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2446: xstrtou_range_sfx_#t~ret118#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet75#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_#t~ret118#1;havoc xstrtou_range_sfx_#t~ret118#1;call xstrtou_range_sfx_#t~mem119#1.base, xstrtou_range_sfx_#t~mem119#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: havoc xstrtou_range_sfx_#t~varargs128#1.base, xstrtou_range_sfx_#t~varargs128#1.offset; [2025-02-08 13:30:23,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479-2: call xstrtou_range_sfx_#t~varargs128#1.base, xstrtou_range_sfx_#t~varargs128#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs128#1.base, xstrtou_range_sfx_#t~varargs128#1.offset, 8);call write~int(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs128#1.base, 8 + xstrtou_range_sfx_#t~varargs128#1.offset, 8);call write~int(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs128#1.base, 16 + xstrtou_range_sfx_#t~varargs128#1.offset, 8); [2025-02-08 13:30:23,774 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2025-02-08 13:30:23,774 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:30:23,784 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:30:23,784 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:30:23,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:30:23 BoogieIcfgContainer [2025-02-08 13:30:23,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:30:23,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:30:23,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:30:23,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:30:23,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:30:21" (1/3) ... [2025-02-08 13:30:23,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322f8476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:30:23, skipping insertion in model container [2025-02-08 13:30:23,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:22" (2/3) ... [2025-02-08 13:30:23,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322f8476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:30:23, skipping insertion in model container [2025-02-08 13:30:23,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:30:23" (3/3) ... [2025-02-08 13:30:23,791 INFO L128 eAbstractionObserver]: Analyzing ICFG usleep-2.i [2025-02-08 13:30:23,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:30:23,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usleep-2.i that has 4 procedures, 132 locations, 1 initial locations, 12 loop locations, and 34 error locations. [2025-02-08 13:30:23,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:30:23,851 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;@49a47016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:30:23,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-02-08 13:30:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 84 states have (on average 1.7261904761904763) internal successors, (145), 122 states have internal predecessors, (145), 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-02-08 13:30:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:30:23,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:23,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:30:23,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash 259141, now seen corresponding path program 1 times [2025-02-08 13:30:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:23,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198185848] [2025-02-08 13:30:23,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:23,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:24,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:30:24,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:30:24,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:24,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:24,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198185848] [2025-02-08 13:30:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198185848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:24,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:30:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876944356] [2025-02-08 13:30:24,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:24,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:24,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:24,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:24,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:24,365 INFO L87 Difference]: Start difference. First operand has 132 states, 84 states have (on average 1.7261904761904763) internal successors, (145), 122 states have internal predecessors, (145), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:24,403 INFO L93 Difference]: Finished difference Result 183 states and 219 transitions. [2025-02-08 13:30:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 13:30:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:24,408 INFO L225 Difference]: With dead ends: 183 [2025-02-08 13:30:24,408 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 13:30:24,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:24,414 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:24,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 13:30:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 13:30:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 47 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-02-08 13:30:24,443 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 3 [2025-02-08 13:30:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:24,444 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-02-08 13:30:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-02-08 13:30:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:30:24,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:24,446 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:30:24,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:30:24,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:24,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash -869670307, now seen corresponding path program 1 times [2025-02-08 13:30:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730153325] [2025-02-08 13:30:24,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:24,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:24,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:24,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:24,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:24,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:24,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730153325] [2025-02-08 13:30:24,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730153325] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:24,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383111486] [2025-02-08 13:30:24,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:24,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:24,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:24,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:24,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:30:24,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:24,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:24,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:24,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:24,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:24,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:24,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:24,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383111486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:24,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:24,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:30:24,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974101223] [2025-02-08 13:30:24,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:24,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:30:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:24,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:30:24,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:24,997 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:25,046 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-02-08 13:30:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:25,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:30:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:25,050 INFO L225 Difference]: With dead ends: 51 [2025-02-08 13:30:25,050 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 13:30:25,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:25,051 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:25,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 139 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 13:30:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-08 13:30:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-02-08 13:30:25,059 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 6 [2025-02-08 13:30:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:25,060 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-02-08 13:30:25,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-02-08 13:30:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:30:25,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:25,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:30:25,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:30:25,264 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-02-08 13:30:25,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:25,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1189975545, now seen corresponding path program 1 times [2025-02-08 13:30:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810388311] [2025-02-08 13:30:25,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:25,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:25,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:30:25,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:30:25,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:25,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:30:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810388311] [2025-02-08 13:30:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810388311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170906545] [2025-02-08 13:30:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:25,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:25,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:25,404 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:25,424 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-02-08 13:30:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:25,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:30:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:25,425 INFO L225 Difference]: With dead ends: 50 [2025-02-08 13:30:25,425 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 13:30:25,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:25,426 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 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-02-08 13:30:25,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 13:30:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-02-08 13:30:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-02-08 13:30:25,429 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2025-02-08 13:30:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:25,429 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-02-08 13:30:25,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-02-08 13:30:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:30:25,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:25,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:25,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:30:25,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:25,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1044717385, now seen corresponding path program 1 times [2025-02-08 13:30:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:25,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036921513] [2025-02-08 13:30:25,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:25,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:25,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:25,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:25,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:25,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:25,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036921513] [2025-02-08 13:30:25,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036921513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:25,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551017091] [2025-02-08 13:30:25,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:25,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:25,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:25,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:25,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:30:25,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:25,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:25,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:25,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:25,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:25,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:30:25,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551017091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135943459] [2025-02-08 13:30:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:25,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:25,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:25,875 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:25,912 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-02-08 13:30:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:30:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:25,913 INFO L225 Difference]: With dead ends: 47 [2025-02-08 13:30:25,913 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 13:30:25,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:25,914 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:25,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 13:30:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 13:30:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 41 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-02-08 13:30:25,920 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 11 [2025-02-08 13:30:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:25,920 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-02-08 13:30:25,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-02-08 13:30:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:30:25,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:25,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:25,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:30:26,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:26,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:26,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1973499623, now seen corresponding path program 1 times [2025-02-08 13:30:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148893194] [2025-02-08 13:30:26,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:26,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:26,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:26,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:26,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148893194] [2025-02-08 13:30:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148893194] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293685247] [2025-02-08 13:30:26,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:26,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:26,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:26,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:30:26,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:26,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:26,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:26,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:26,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:26,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:26,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293685247] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:26,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:30:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945978425] [2025-02-08 13:30:26,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:26,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:26,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:26,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:26,644 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:26,672 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2025-02-08 13:30:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:26,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:30:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:26,673 INFO L225 Difference]: With dead ends: 94 [2025-02-08 13:30:26,673 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 13:30:26,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:26,674 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:26,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 13:30:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 13:30:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-02-08 13:30:26,677 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2025-02-08 13:30:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:26,677 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-02-08 13:30:26,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-02-08 13:30:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:30:26,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:26,678 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:26,686 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-02-08 13:30:26,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:26,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 558910671, now seen corresponding path program 2 times [2025-02-08 13:30:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381809824] [2025-02-08 13:30:26,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:26,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:26,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:30:26,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:30:26,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:26,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:27,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:27,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381809824] [2025-02-08 13:30:27,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381809824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:27,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:27,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:30:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515938714] [2025-02-08 13:30:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:27,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:27,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:27,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:27,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:27,112 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:27,163 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-02-08 13:30:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:27,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:30:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:27,164 INFO L225 Difference]: With dead ends: 54 [2025-02-08 13:30:27,164 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 13:30:27,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-08 13:30:27,165 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:27,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 126 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 13:30:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 13:30:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 48 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-02-08 13:30:27,170 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2025-02-08 13:30:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:27,171 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-02-08 13:30:27,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-02-08 13:30:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:30:27,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:27,173 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:27,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:30:27,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:27,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1290467626, now seen corresponding path program 1 times [2025-02-08 13:30:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63067137] [2025-02-08 13:30:27,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:27,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:30:27,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:30:27,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:27,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63067137] [2025-02-08 13:30:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63067137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:27,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:27,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:30:27,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421963984] [2025-02-08 13:30:27,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:27,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:27,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:27,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:27,359 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:27,409 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2025-02-08 13:30:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:27,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:30:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:27,410 INFO L225 Difference]: With dead ends: 84 [2025-02-08 13:30:27,410 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 13:30:27,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:27,411 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:27,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 13:30:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 13:30:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-02-08 13:30:27,414 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2025-02-08 13:30:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:27,414 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-02-08 13:30:27,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-02-08 13:30:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:27,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:27,415 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:27,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:30:27,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:27,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:27,415 INFO L85 PathProgramCache]: Analyzing trace with hash 73724936, now seen corresponding path program 1 times [2025-02-08 13:30:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:27,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464234602] [2025-02-08 13:30:27,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:27,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:27,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:27,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:27,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:27,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:27,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464234602] [2025-02-08 13:30:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464234602] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571247507] [2025-02-08 13:30:27,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:27,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:27,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:27,591 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-02-08 13:30:27,592 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-02-08 13:30:27,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:27,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:27,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:27,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:27,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:27,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:30:27,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571247507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:27,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:27,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:27,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356853949] [2025-02-08 13:30:27,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:27,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:27,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:27,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:27,863 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:27,907 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2025-02-08 13:30:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:27,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:30:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:27,908 INFO L225 Difference]: With dead ends: 55 [2025-02-08 13:30:27,908 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 13:30:27,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:27,909 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:27,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 13:30:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 13:30:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-02-08 13:30:27,912 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 29 [2025-02-08 13:30:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:27,912 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-02-08 13:30:27,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-02-08 13:30:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:27,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:27,913 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:27,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:30:28,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:30:28,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:28,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 73725096, now seen corresponding path program 1 times [2025-02-08 13:30:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554486259] [2025-02-08 13:30:28,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:28,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:28,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:28,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:28,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:28,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554486259] [2025-02-08 13:30:28,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554486259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:28,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084244912] [2025-02-08 13:30:28,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:28,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:28,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:28,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:28,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:30:28,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:28,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:28,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:28,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:28,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:30:28,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:30:28,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:30:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084244912] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:28,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:30:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529142825] [2025-02-08 13:30:28,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:30:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:28,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:30:28,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:28,649 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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-02-08 13:30:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:28,740 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2025-02-08 13:30:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:30:28,741 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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 29 [2025-02-08 13:30:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:28,741 INFO L225 Difference]: With dead ends: 111 [2025-02-08 13:30:28,741 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 13:30:28,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:28,742 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:28,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 247 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:28,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 13:30:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-08 13:30:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-02-08 13:30:28,749 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 29 [2025-02-08 13:30:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:28,749 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-02-08 13:30:28,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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-02-08 13:30:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-02-08 13:30:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:30:28,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:28,750 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:28,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:30:28,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:28,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:28,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:28,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1270224329, now seen corresponding path program 1 times [2025-02-08 13:30:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112038187] [2025-02-08 13:30:28,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:28,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:28,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:30:29,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:30:29,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:29,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112038187] [2025-02-08 13:30:29,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112038187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:29,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:29,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:30:29,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972636406] [2025-02-08 13:30:29,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:29,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:29,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:29,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:29,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:29,150 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:29,215 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2025-02-08 13:30:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:29,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-08 13:30:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:29,216 INFO L225 Difference]: With dead ends: 80 [2025-02-08 13:30:29,216 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 13:30:29,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:30:29,217 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:29,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 13:30:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-02-08 13:30:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.164179104477612) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-02-08 13:30:29,224 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 47 [2025-02-08 13:30:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:29,225 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-02-08 13:30:29,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-02-08 13:30:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:30:29,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:29,226 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:29,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:30:29,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:29,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1270254120, now seen corresponding path program 1 times [2025-02-08 13:30:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897216313] [2025-02-08 13:30:29,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:29,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:30:29,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:30:29,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897216313] [2025-02-08 13:30:29,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897216313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:29,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:29,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:30:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318556931] [2025-02-08 13:30:29,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:29,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:30:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:29,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:30:29,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:30:29,613 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:29,677 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-02-08 13:30:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:29,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-08 13:30:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:29,679 INFO L225 Difference]: With dead ends: 109 [2025-02-08 13:30:29,680 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 13:30:29,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:30:29,681 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:29,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 128 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 13:30:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-02-08 13:30:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2025-02-08 13:30:29,691 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 47 [2025-02-08 13:30:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:29,692 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2025-02-08 13:30:29,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2025-02-08 13:30:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:30:29,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:29,692 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:29,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:30:29,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:29,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:29,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2070903284, now seen corresponding path program 1 times [2025-02-08 13:30:29,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:29,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494612145] [2025-02-08 13:30:29,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:29,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:29,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:30:29,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:30:29,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:29,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:30:29,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:29,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494612145] [2025-02-08 13:30:29,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494612145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:29,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:29,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840821883] [2025-02-08 13:30:29,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:29,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:29,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:29,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:29,857 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:29,881 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2025-02-08 13:30:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:29,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:30:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:29,882 INFO L225 Difference]: With dead ends: 84 [2025-02-08 13:30:29,882 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 13:30:29,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:29,883 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:29,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 13:30:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-02-08 13:30:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-02-08 13:30:29,890 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 48 [2025-02-08 13:30:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:29,890 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-02-08 13:30:29,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-02-08 13:30:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:30:29,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:29,893 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:29,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:30:29,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:29,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash 333683138, now seen corresponding path program 1 times [2025-02-08 13:30:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205785906] [2025-02-08 13:30:29,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:29,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:30:29,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:30:29,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:29,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:30,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:30,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205785906] [2025-02-08 13:30:30,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205785906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:30,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105619860] [2025-02-08 13:30:30,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:30,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:30,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:30,079 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:30,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:30:30,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:30:30,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:30:30,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:30,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:30,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:30,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:30,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105619860] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:30,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:30,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:30:30,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229104353] [2025-02-08 13:30:30,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:30,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:30,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:30,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:30,444 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:30,483 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2025-02-08 13:30:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:30,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:30:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:30,484 INFO L225 Difference]: With dead ends: 130 [2025-02-08 13:30:30,484 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 13:30:30,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:30,484 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:30,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 13:30:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 13:30:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 93 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2025-02-08 13:30:30,489 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 54 [2025-02-08 13:30:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:30,490 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2025-02-08 13:30:30,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2025-02-08 13:30:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 13:30:30,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:30,491 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:30,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:30:30,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:30:30,692 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:30,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1803482656, now seen corresponding path program 2 times [2025-02-08 13:30:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:30,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337400937] [2025-02-08 13:30:30,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:30,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-08 13:30:30,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 13:30:30,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:30:30,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:31,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:31,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337400937] [2025-02-08 13:30:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337400937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:31,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980764659] [2025-02-08 13:30:31,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:31,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:31,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:31,072 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:31,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:30:31,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-08 13:30:31,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 13:30:31,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:30:31,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:31,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:30:31,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:31,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980764659] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:31,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:31,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:30:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772835497] [2025-02-08 13:30:31,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:31,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:30:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:31,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:30:31,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:30:31,634 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:31,704 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2025-02-08 13:30:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:30:31,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-02-08 13:30:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:31,705 INFO L225 Difference]: With dead ends: 175 [2025-02-08 13:30:31,705 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 13:30:31,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:30:31,706 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:31,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 193 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 13:30:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-08 13:30:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 126 states have (on average 1.0873015873015872) internal successors, (137), 129 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2025-02-08 13:30:31,713 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 63 [2025-02-08 13:30:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:31,713 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2025-02-08 13:30:31,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2025-02-08 13:30:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 13:30:31,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:31,714 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:31,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 13:30:31,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:31,914 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 31 more)] === [2025-02-08 13:30:31,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1320534048, now seen corresponding path program 3 times [2025-02-08 13:30:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040484055] [2025-02-08 13:30:31,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:30:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:31,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 12 equivalence classes. [2025-02-08 13:30:32,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 13:30:32,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-08 13:30:32,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-08 13:30:36,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:36,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040484055] [2025-02-08 13:30:36,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040484055] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:36,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544257196] [2025-02-08 13:30:36,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:30:36,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:36,383 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:36,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:30:36,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 12 equivalence classes. [2025-02-08 13:31:18,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 13:31:18,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-08 13:31:18,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:18,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-08 13:31:18,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:18,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 13:31:18,863 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:31:18,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 13:31:18,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 13:31:18,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 13:31:18,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:18,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:18,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2025-02-08 13:31:18,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:18,957 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2025-02-08 13:31:18,974 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-02-08 13:31:18,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 59 [2025-02-08 13:31:18,984 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 13 [2025-02-08 13:31:18,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-08 13:31:18,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 13:31:19,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:19,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:19,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2025-02-08 13:31:19,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:19,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2025-02-08 13:31:19,030 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2025-02-08 13:31:19,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 1 [2025-02-08 13:31:19,075 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,087 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 13 [2025-02-08 13:31:19,134 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,140 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 13 [2025-02-08 13:31:19,182 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,186 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 13 [2025-02-08 13:31:19,225 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,229 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 13 [2025-02-08 13:31:19,269 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,272 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 13 [2025-02-08 13:31:19,310 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,314 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 13 [2025-02-08 13:31:19,349 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,355 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 13 [2025-02-08 13:31:19,389 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,394 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 13 [2025-02-08 13:31:19,433 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,440 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 13 [2025-02-08 13:31:19,478 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:19,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 13:31:19,482 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 13 [2025-02-08 13:31:19,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-08 13:31:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-08 13:31:19,585 INFO L312 TraceCheckSpWp]: Computing backward predicates...