./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/usleep-1.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-1.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 a7112737a3c832c1ddda92159d204e858126bb49c67e3c039f3263a2d46a93e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:30:13,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:30:13,531 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:13,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:30:13,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:30:13,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:30:13,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:30:13,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:30:13,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:30:13,563 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:30:13,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:30:13,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:30:13,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:30:13,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:30:13,564 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:30:13,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:30:13,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:30:13,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:30:13,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:30:13,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:30:13,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:30:13,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:30:13,565 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:30:13,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:30:13,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:30:13,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:30:13,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:30:13,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:30:13,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:30:13,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:30:13,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:30:13,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:30:13,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:30:13,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:30:13,567 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 -> a7112737a3c832c1ddda92159d204e858126bb49c67e3c039f3263a2d46a93e3 [2025-02-08 13:30:13,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:30:13,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:30:13,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:30:13,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:30:13,810 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:30:13,812 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-1.i [2025-02-08 13:30:15,003 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ddb63f16/13148394573749abb0c91a0f306b92cc/FLAGb82cdb73a [2025-02-08 13:30:15,407 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:30:15,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/usleep-1.i [2025-02-08 13:30:15,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ddb63f16/13148394573749abb0c91a0f306b92cc/FLAGb82cdb73a [2025-02-08 13:30:15,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ddb63f16/13148394573749abb0c91a0f306b92cc [2025-02-08 13:30:15,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:30:15,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:30:15,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:30:15,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:30:15,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:30:15,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:30:15" (1/1) ... [2025-02-08 13:30:15,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c7dd9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:15, skipping insertion in model container [2025-02-08 13:30:15,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:30:15" (1/1) ... [2025-02-08 13:30:15,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:30:16,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:30:16,194 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:30:16,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:30:16,384 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:30:16,389 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:30:16,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:16 WrapperNode [2025-02-08 13:30:16,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:30:16,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:30:16,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:30:16,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:30:16,395 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:16" (1/1) ... [2025-02-08 13:30:16,423 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:16" (1/1) ... [2025-02-08 13:30:16,484 INFO L138 Inliner]: procedures = 598, calls = 512, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 901 [2025-02-08 13:30:16,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:30:16,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:30:16,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:30:16,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:30:16,495 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:16" (1/1) ... [2025-02-08 13:30:16,496 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:16" (1/1) ... [2025-02-08 13:30:16,508 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:16" (1/1) ... [2025-02-08 13:30:16,529 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:30:16,532 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:16" (1/1) ... [2025-02-08 13:30:16,533 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:16" (1/1) ... [2025-02-08 13:30:16,567 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:16" (1/1) ... [2025-02-08 13:30:16,570 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:16" (1/1) ... [2025-02-08 13:30:16,574 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:16" (1/1) ... [2025-02-08 13:30:16,578 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:16" (1/1) ... [2025-02-08 13:30:16,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:30:16,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:30:16,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:30:16,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:30:16,586 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:16" (1/1) ... [2025-02-08 13:30:16,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:30:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:16,612 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:16,619 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:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:30:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:30:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:30:16,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:30:16,636 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:30:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:30:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:30:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:30:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:30:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:30:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:30:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:30:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:30:16,915 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:30:16,917 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:30:17,197 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:17,198 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:17,198 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:17,198 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:17,198 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:17,198 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:17,198 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:17,198 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:17,199 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:17,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376: assume !true; [2025-02-08 13:30:17,199 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:17,199 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:17,199 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:17,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2385-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:30:17,200 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:17,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2559: write_#res#1 := write_~ret~1#1; [2025-02-08 13:30:17,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: assume full_write_~cc~0#1 < 0; [2025-02-08 13:30:17,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:30:17,200 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:17,200 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:17,200 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:17,200 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:17,200 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:17,486 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:17,486 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:17,486 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:17,486 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:17,486 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:17,486 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:17,486 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453: assume !true; [2025-02-08 13:30:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,487 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:17,539 INFO L? ?]: Removed 231 outVars from TransFormulas that were not future-live. [2025-02-08 13:30:17,540 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:30:17,556 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:30:17,557 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:30:17,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:30:17 BoogieIcfgContainer [2025-02-08 13:30:17,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:30:17,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:30:17,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:30:17,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:30:17,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:30:15" (1/3) ... [2025-02-08 13:30:17,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8fe53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:30:17, skipping insertion in model container [2025-02-08 13:30:17,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:30:16" (2/3) ... [2025-02-08 13:30:17,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8fe53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:30:17, skipping insertion in model container [2025-02-08 13:30:17,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:30:17" (3/3) ... [2025-02-08 13:30:17,564 INFO L128 eAbstractionObserver]: Analyzing ICFG usleep-1.i [2025-02-08 13:30:17,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:30:17,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usleep-1.i that has 4 procedures, 148 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-02-08 13:30:17,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:30:17,615 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;@1073d829, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:30:17,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-08 13:30:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 92 states have (on average 1.75) internal successors, (161), 138 states have internal predecessors, (161), 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:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:30:17,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:17,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:30:17,622 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 39 more)] === [2025-02-08 13:30:17,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash 275029, now seen corresponding path program 1 times [2025-02-08 13:30:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:17,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252152290] [2025-02-08 13:30:17,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:17,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:17,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:30:17,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:30:17,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:17,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:18,062 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:18,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:18,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252152290] [2025-02-08 13:30:18,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252152290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:18,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:18,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:30:18,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708608018] [2025-02-08 13:30:18,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:18,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:18,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:18,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:18,081 INFO L87 Difference]: Start difference. First operand has 148 states, 92 states have (on average 1.75) internal successors, (161), 138 states have internal predecessors, (161), 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:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:18,120 INFO L93 Difference]: Finished difference Result 199 states and 235 transitions. [2025-02-08 13:30:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:18,121 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:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:18,125 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:30:18,125 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 13:30:18,128 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:18,130 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:18,130 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:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 13:30:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 13:30:18,149 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:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-02-08 13:30:18,153 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 3 [2025-02-08 13:30:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:18,153 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-02-08 13:30:18,153 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:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-02-08 13:30:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:30:18,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:18,154 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:30:18,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:30:18,154 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 39 more)] === [2025-02-08 13:30:18,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -396335011, now seen corresponding path program 1 times [2025-02-08 13:30:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074724453] [2025-02-08 13:30:18,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:18,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:18,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:18,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:18,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:18,404 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:18,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074724453] [2025-02-08 13:30:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074724453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352602291] [2025-02-08 13:30:18,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:18,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:18,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:18,409 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:18,410 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:18,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:18,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:18,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:18,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:18,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:18,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:18,687 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:18,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:18,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352602291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:18,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:30:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221069331] [2025-02-08 13:30:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:18,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:30:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:18,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:30:18,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:18,690 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:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:18,727 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-02-08 13:30:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:18,728 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:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:18,728 INFO L225 Difference]: With dead ends: 51 [2025-02-08 13:30:18,728 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 13:30:18,729 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:18,729 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:18,729 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:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 13:30:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-08 13:30:18,732 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:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-02-08 13:30:18,732 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 6 [2025-02-08 13:30:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:18,733 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-02-08 13:30:18,733 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:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-02-08 13:30:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:30:18,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:18,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:30:18,744 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:18,934 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:18,934 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 39 more)] === [2025-02-08 13:30:18,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 598516759, now seen corresponding path program 1 times [2025-02-08 13:30:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:18,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22329267] [2025-02-08 13:30:18,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:18,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:18,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:30:19,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:30:19,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:19,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:19,095 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:19,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:19,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22329267] [2025-02-08 13:30:19,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22329267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:19,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:19,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312762479] [2025-02-08 13:30:19,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:19,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:19,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:19,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:19,096 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:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:19,118 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-02-08 13:30:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:19,119 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:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:19,120 INFO L225 Difference]: With dead ends: 50 [2025-02-08 13:30:19,120 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 13:30:19,120 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:19,121 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:19,121 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:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 13:30:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-02-08 13:30:19,124 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:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-02-08 13:30:19,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2025-02-08 13:30:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:19,125 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-02-08 13:30:19,125 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:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-02-08 13:30:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:30:19,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:19,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:19,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:30:19,126 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 39 more)] === [2025-02-08 13:30:19,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2121197881, now seen corresponding path program 1 times [2025-02-08 13:30:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934686284] [2025-02-08 13:30:19,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:19,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:19,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:19,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:19,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:19,364 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:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934686284] [2025-02-08 13:30:19,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934686284] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300022764] [2025-02-08 13:30:19,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:19,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:19,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:19,371 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:19,375 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:19,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:19,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:19,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:19,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:19,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:19,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:19,640 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:19,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300022764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:19,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:19,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:19,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144123778] [2025-02-08 13:30:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:19,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:19,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:19,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:19,643 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:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:19,674 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-02-08 13:30:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:19,674 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:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:19,675 INFO L225 Difference]: With dead ends: 47 [2025-02-08 13:30:19,675 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 13:30:19,675 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:19,676 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:19,676 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:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 13:30:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 13:30:19,679 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:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-02-08 13:30:19,679 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 11 [2025-02-08 13:30:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:19,679 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-02-08 13:30:19,679 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:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-02-08 13:30:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:30:19,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:19,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:19,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:30:19,884 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:19,884 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 39 more)] === [2025-02-08 13:30:19,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1332624665, now seen corresponding path program 1 times [2025-02-08 13:30:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469911111] [2025-02-08 13:30:19,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:19,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:19,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:19,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:19,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:20,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:20,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469911111] [2025-02-08 13:30:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469911111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:20,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919804027] [2025-02-08 13:30:20,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:20,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:20,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:20,018 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:20,020 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:20,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:20,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:20,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:20,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:20,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:20,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:20,269 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:20,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:20,291 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:20,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919804027] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:20,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:20,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:30:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246808431] [2025-02-08 13:30:20,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:20,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:20,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:20,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:20,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:20,293 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:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:20,314 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2025-02-08 13:30:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:20,315 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:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:20,316 INFO L225 Difference]: With dead ends: 94 [2025-02-08 13:30:20,316 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 13:30:20,316 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:20,316 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:20,317 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:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 13:30:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 13:30:20,319 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:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-02-08 13:30:20,320 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2025-02-08 13:30:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:20,320 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-02-08 13:30:20,320 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:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-02-08 13:30:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:30:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:20,321 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:20,333 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:20,525 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:20,525 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 39 more)] === [2025-02-08 13:30:20,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:20,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1959708449, now seen corresponding path program 2 times [2025-02-08 13:30:20,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:20,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916233056] [2025-02-08 13:30:20,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:20,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:20,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:30:20,594 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:20,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:20,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:20,745 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:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:20,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916233056] [2025-02-08 13:30:20,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916233056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:20,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:20,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:30:20,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470422755] [2025-02-08 13:30:20,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:20,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:20,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:20,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:20,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:20,746 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:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:20,786 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-02-08 13:30:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:20,787 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:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:20,787 INFO L225 Difference]: With dead ends: 54 [2025-02-08 13:30:20,787 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 13:30:20,788 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:20,788 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:20,788 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:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 13:30:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 13:30:20,795 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:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-02-08 13:30:20,796 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2025-02-08 13:30:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:20,796 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-02-08 13:30:20,796 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:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-02-08 13:30:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:30:20,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:20,797 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:20,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:30:20,797 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 39 more)] === [2025-02-08 13:30:20,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash -487320790, now seen corresponding path program 1 times [2025-02-08 13:30:20,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:20,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055088579] [2025-02-08 13:30:20,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:20,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:30:20,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:30:20,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:20,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:20,943 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:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:20,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055088579] [2025-02-08 13:30:20,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055088579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:20,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:20,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:30:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775672887] [2025-02-08 13:30:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:20,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:20,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:20,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:20,944 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:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:20,972 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2025-02-08 13:30:20,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:20,972 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:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:20,973 INFO L225 Difference]: With dead ends: 84 [2025-02-08 13:30:20,973 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 13:30:20,973 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:20,973 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:20,973 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:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 13:30:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 13:30:20,976 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:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-02-08 13:30:20,977 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2025-02-08 13:30:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:20,977 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-02-08 13:30:20,977 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:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-02-08 13:30:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:20,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:20,978 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:20,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:30:20,978 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 39 more)] === [2025-02-08 13:30:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash -779233256, now seen corresponding path program 1 times [2025-02-08 13:30:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322875815] [2025-02-08 13:30:20,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:21,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:21,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:21,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:21,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:21,148 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:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322875815] [2025-02-08 13:30:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322875815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437758182] [2025-02-08 13:30:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:21,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:21,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:21,154 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:21,155 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:21,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:21,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:21,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:21,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:21,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:21,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:21,412 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:21,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437758182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425297822] [2025-02-08 13:30:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:21,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:21,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:21,414 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:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:21,440 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2025-02-08 13:30:21,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:21,440 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:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:21,441 INFO L225 Difference]: With dead ends: 55 [2025-02-08 13:30:21,441 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 13:30:21,441 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:21,442 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:21,442 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:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 13:30:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 13:30:21,445 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:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-02-08 13:30:21,445 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 29 [2025-02-08 13:30:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:21,445 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-02-08 13:30:21,446 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:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-02-08 13:30:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:21,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:21,446 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:21,455 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:21,646 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:21,647 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 39 more)] === [2025-02-08 13:30:21,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash -779233096, now seen corresponding path program 1 times [2025-02-08 13:30:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:21,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336618997] [2025-02-08 13:30:21,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:21,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:21,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:21,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:21,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:21,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:21,828 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:21,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:21,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336618997] [2025-02-08 13:30:21,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336618997] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:21,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470748983] [2025-02-08 13:30:21,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:21,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:21,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:21,833 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:21,834 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:21,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:22,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:22,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:22,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:30:22,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:22,139 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:22,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:22,205 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:22,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470748983] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:22,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:22,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:30:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682107881] [2025-02-08 13:30:22,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:22,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:30:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:22,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:30:22,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:22,206 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:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:22,292 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2025-02-08 13:30:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:30:22,292 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:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:22,293 INFO L225 Difference]: With dead ends: 111 [2025-02-08 13:30:22,293 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 13:30:22,293 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:22,294 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:22,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 212 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 13:30:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-08 13:30:22,297 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:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-02-08 13:30:22,298 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 29 [2025-02-08 13:30:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:22,298 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-02-08 13:30:22,298 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:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-02-08 13:30:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:30:22,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:22,299 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:22,307 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:22,499 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:22,500 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 39 more)] === [2025-02-08 13:30:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 69347289, now seen corresponding path program 1 times [2025-02-08 13:30:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449178423] [2025-02-08 13:30:22,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:22,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:22,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:30:22,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:30:22,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:22,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:22,687 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:22,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:22,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449178423] [2025-02-08 13:30:22,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449178423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:22,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:22,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:30:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080741710] [2025-02-08 13:30:22,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:22,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:22,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:22,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:22,689 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:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:22,744 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2025-02-08 13:30:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:22,745 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:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:22,745 INFO L225 Difference]: With dead ends: 80 [2025-02-08 13:30:22,745 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 13:30:22,746 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:22,746 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:22,746 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.0s Time] [2025-02-08 13:30:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 13:30:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-02-08 13:30:22,750 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:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-02-08 13:30:22,750 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 47 [2025-02-08 13:30:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:22,750 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-02-08 13:30:22,750 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:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-02-08 13:30:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:30:22,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:22,754 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:22,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:30:22,754 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 39 more)] === [2025-02-08 13:30:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash 69377080, now seen corresponding path program 1 times [2025-02-08 13:30:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455677150] [2025-02-08 13:30:22,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:22,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:30:22,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:30:22,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:22,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:23,085 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:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455677150] [2025-02-08 13:30:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455677150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:23,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:23,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:30:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041089958] [2025-02-08 13:30:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:23,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:30:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:23,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:30:23,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:30:23,086 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:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:23,150 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-02-08 13:30:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:23,151 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:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:23,152 INFO L225 Difference]: With dead ends: 109 [2025-02-08 13:30:23,152 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 13:30:23,152 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:23,153 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:23,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 13:30:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-02-08 13:30:23,157 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:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2025-02-08 13:30:23,157 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 47 [2025-02-08 13:30:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2025-02-08 13:30:23,158 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:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2025-02-08 13:30:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:30:23,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:23,158 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:23,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:30:23,159 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 39 more)] === [2025-02-08 13:30:23,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash -643385844, now seen corresponding path program 1 times [2025-02-08 13:30:23,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:23,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882054214] [2025-02-08 13:30:23,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:23,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:30:23,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:30:23,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:23,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:23,293 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:23,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:23,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882054214] [2025-02-08 13:30:23,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882054214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:23,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002105222] [2025-02-08 13:30:23,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:23,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:23,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:23,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:23,295 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:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:23,316 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2025-02-08 13:30:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:23,317 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:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:23,317 INFO L225 Difference]: With dead ends: 84 [2025-02-08 13:30:23,317 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 13:30:23,317 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:23,318 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:23,318 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:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 13:30:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-02-08 13:30:23,321 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:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-02-08 13:30:23,322 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 48 [2025-02-08 13:30:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:23,322 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-02-08 13:30:23,322 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:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-02-08 13:30:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:30:23,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:23,323 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:23,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:30:23,323 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 39 more)] === [2025-02-08 13:30:23,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash 130830274, now seen corresponding path program 1 times [2025-02-08 13:30:23,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:23,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599645937] [2025-02-08 13:30:23,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:23,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:30:23,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:30:23,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:23,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:23,472 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:23,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599645937] [2025-02-08 13:30:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599645937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206731086] [2025-02-08 13:30:23,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:23,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:23,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:23,474 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:23,476 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:23,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:30:23,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:30:23,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:23,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:23,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:23,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:23,825 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:23,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:23,843 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:23,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206731086] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:23,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:23,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:30:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368716933] [2025-02-08 13:30:23,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:23,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:23,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:23,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:23,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:23,845 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:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:23,884 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2025-02-08 13:30:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:23,884 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:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:23,885 INFO L225 Difference]: With dead ends: 130 [2025-02-08 13:30:23,885 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 13:30:23,885 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:23,886 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:23,886 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:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 13:30:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 13:30:23,891 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:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2025-02-08 13:30:23,892 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 54 [2025-02-08 13:30:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:23,892 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2025-02-08 13:30:23,892 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:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2025-02-08 13:30:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 13:30:23,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:23,893 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:23,901 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:24,093 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:24,094 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 39 more)] === [2025-02-08 13:30:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -386331664, now seen corresponding path program 2 times [2025-02-08 13:30:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612328323] [2025-02-08 13:30:24,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:24,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-08 13:30:24,286 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:24,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:30:24,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:24,456 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:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612328323] [2025-02-08 13:30:24,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612328323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895459094] [2025-02-08 13:30:24,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:24,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:24,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:24,459 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:24,460 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:24,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-08 13:30:24,891 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:24,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:30:24,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:24,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:30:24,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:24,919 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:24,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:24,973 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:24,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895459094] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:24,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:24,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:30:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846423200] [2025-02-08 13:30:24,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:24,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:30:24,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:24,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:30:24,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:30:24,975 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:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:25,051 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2025-02-08 13:30:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:30:25,052 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:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:25,052 INFO L225 Difference]: With dead ends: 175 [2025-02-08 13:30:25,052 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 13:30:25,053 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:25,053 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:25,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 269 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 13:30:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-08 13:30:25,059 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:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2025-02-08 13:30:25,060 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 63 [2025-02-08 13:30:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:25,060 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2025-02-08 13:30:25,060 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:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2025-02-08 13:30:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 13:30:25,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:25,061 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:25,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:30:25,261 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:25,262 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 39 more)] === [2025-02-08 13:30:25,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash -265981904, now seen corresponding path program 3 times [2025-02-08 13:30:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329285709] [2025-02-08 13:30:25,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:30:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:25,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 12 equivalence classes. [2025-02-08 13:30:25,970 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:25,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-08 13:30:25,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:29,514 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:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329285709] [2025-02-08 13:30:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329285709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083067351] [2025-02-08 13:30:29,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:30:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:29,517 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:29,518 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:29,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 12 equivalence classes. [2025-02-08 13:31:04,177 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:04,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-08 13:31:04,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:04,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-08 13:31:04,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:04,248 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:04,319 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:31:04,319 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:04,326 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:04,338 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:04,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:04,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:04,434 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:04,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:04,448 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:04,477 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-02-08 13:31:04,478 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:04,485 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:04,496 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:04,511 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:04,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:04,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:04,527 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:04,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:04,544 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:04,562 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2025-02-08 13:31:04,562 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:04,648 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:04,648 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:04,661 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:04,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:04,718 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:04,725 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:04,765 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:04,765 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:04,770 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:04,811 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:04,811 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:04,815 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:04,858 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:04,859 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:04,862 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:04,900 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:04,900 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:04,904 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:04,940 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:04,940 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:04,945 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:04,981 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:04,981 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:04,987 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:05,023 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:05,024 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:05,030 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:05,068 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:05,068 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:05,072 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:05,162 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:05,178 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:05,178 INFO L312 TraceCheckSpWp]: Computing backward predicates...