./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9cdcebc161918b7eba8ddf37eb6929c1febb35920ec9e070875db56fc6754865 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:31:27,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:31:27,815 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:31:27,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:31:27,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:31:27,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:31:27,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:31:27,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:31:27,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:31:27,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:31:27,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:31:27,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:31:27,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:31:27,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:31:27,844 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:31:27,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:31:27,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:31:27,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:31:27,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:31:27,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:31:27,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:31:27,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:31:27,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:31:27,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:31:27,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:31:27,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:31:27,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:31:27,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:31:27,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:31:27,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:31:27,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:31:27,847 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 -> 9cdcebc161918b7eba8ddf37eb6929c1febb35920ec9e070875db56fc6754865 [2025-02-08 13:31:28,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:31:28,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:31:28,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:31:28,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:31:28,093 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:31:28,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i [2025-02-08 13:31:29,191 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/079fd7489/2c920b8dac0e4031b52c7f4673e4ec1e/FLAGcb03e6dd7 [2025-02-08 13:31:29,573 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:31:29,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i [2025-02-08 13:31:29,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/079fd7489/2c920b8dac0e4031b52c7f4673e4ec1e/FLAGcb03e6dd7 [2025-02-08 13:31:29,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/079fd7489/2c920b8dac0e4031b52c7f4673e4ec1e [2025-02-08 13:31:29,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:31:29,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:31:29,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:31:29,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:31:29,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:31:29,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:31:29" (1/1) ... [2025-02-08 13:31:29,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c78adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:29, skipping insertion in model container [2025-02-08 13:31:29,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:31:29" (1/1) ... [2025-02-08 13:31:29,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:31:30,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:31:30,563 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:31:30,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:31:30,744 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:31:30,764 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:31:30,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30 WrapperNode [2025-02-08 13:31:30,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:31:30,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:31:30,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:31:30,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:31:30,773 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:31:30" (1/1) ... [2025-02-08 13:31:30,845 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:31:30" (1/1) ... [2025-02-08 13:31:30,883 INFO L138 Inliner]: procedures = 613, calls = 509, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 809 [2025-02-08 13:31:30,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:31:30,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:31:30,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:31:30,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:31:30,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,925 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:31:30,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:30,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:31:30,998 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:31:30,998 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:31:30,998 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:31:30,999 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (1/1) ... [2025-02-08 13:31:31,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:31:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:31,030 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:31:31,032 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:31:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:31:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:31:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:31:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-02-08 13:31:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-02-08 13:31:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:31:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:31:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:31:31,318 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:31:31,319 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:31:31,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2397-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 13:31:31,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2397-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:31:31,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2381: 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:31:31,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2382: assume full_write_~cc~0#1 < 0; [2025-02-08 13:31:31,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2382: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:31:31,843 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399: safe_write_#t~ret105#1 := write_#res#1;havoc write_#t~nondet153#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:31:31,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: havoc bb_internal_getpwuid_#t~ret120#1.base, bb_internal_getpwuid_#t~ret120#1.offset; [2025-02-08 13:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2400: 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:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2400: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2384: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2384: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2363: 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:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: 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:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:31:31,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2446: havoc xuid2uname_#t~mem116#1.base, xuid2uname_#t~mem116#1.offset; [2025-02-08 13:31:31,902 INFO L? ?]: Removed 204 outVars from TransFormulas that were not future-live. [2025-02-08 13:31:31,902 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:31:31,917 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:31:31,917 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:31:31,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:31 BoogieIcfgContainer [2025-02-08 13:31:31,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:31:31,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:31:31,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:31:31,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:31:31,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:31:29" (1/3) ... [2025-02-08 13:31:31,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51799c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:31:31, skipping insertion in model container [2025-02-08 13:31:31,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:31:30" (2/3) ... [2025-02-08 13:31:31,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51799c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:31:31, skipping insertion in model container [2025-02-08 13:31:31,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:31:31" (3/3) ... [2025-02-08 13:31:31,926 INFO L128 eAbstractionObserver]: Analyzing ICFG whoami-incomplete-2.i [2025-02-08 13:31:31,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:31:31,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG whoami-incomplete-2.i that has 4 procedures, 131 locations, 1 initial locations, 11 loop locations, and 32 error locations. [2025-02-08 13:31:31,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:31:31,985 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;@5db236d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:31:31,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-08 13:31:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 120 states have internal predecessors, (142), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:31:31,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:31,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:31:31,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:31,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash 212470, now seen corresponding path program 1 times [2025-02-08 13:31:32,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:32,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274421089] [2025-02-08 13:31:32,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:32,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:31:32,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:31:32,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:32,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:32,542 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:31:32,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274421089] [2025-02-08 13:31:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274421089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:32,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:32,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:31:32,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745507555] [2025-02-08 13:31:32,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:32,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:32,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:32,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:32,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:32,564 INFO L87 Difference]: Start difference. First operand has 131 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 120 states have internal predecessors, (142), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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:31:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:32,609 INFO L93 Difference]: Finished difference Result 179 states and 215 transitions. [2025-02-08 13:31:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:32,611 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:31:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:32,616 INFO L225 Difference]: With dead ends: 179 [2025-02-08 13:31:32,616 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 13:31:32,619 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:31:32,622 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 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:31:32,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 13:31:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-08 13:31:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 46 states have internal predecessors, (51), 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:31:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-02-08 13:31:32,653 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 3 [2025-02-08 13:31:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:32,654 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-02-08 13:31:32,654 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:31:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-02-08 13:31:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:31:32,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:32,655 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:31:32,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:31:32,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:32,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2034874557, now seen corresponding path program 1 times [2025-02-08 13:31:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115345030] [2025-02-08 13:31:32,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:32,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:31:32,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:31:32,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:32,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:32,899 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:31:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115345030] [2025-02-08 13:31:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115345030] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049669580] [2025-02-08 13:31:32,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:32,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:32,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:32,902 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:31:32,904 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:31:33,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:31:33,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:31:33,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:33,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:33,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:33,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:33,192 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:31:33,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049669580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:31:33,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687226140] [2025-02-08 13:31:33,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:33,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:31:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:33,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:31:33,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:33,194 INFO L87 Difference]: Start difference. First operand 50 states and 54 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:31:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:33,233 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-02-08 13:31:33,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:31:33,234 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:31:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:33,234 INFO L225 Difference]: With dead ends: 50 [2025-02-08 13:31:33,235 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 13:31:33,235 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:31:33,235 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:33,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 13:31:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 13:31:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 45 states have internal predecessors, (50), 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:31:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-02-08 13:31:33,243 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 6 [2025-02-08 13:31:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:33,243 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-08 13:31:33,243 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:31:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-02-08 13:31:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:31:33,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:33,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:31:33,253 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:31:33,444 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:31:33,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:33,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1343398024, now seen corresponding path program 1 times [2025-02-08 13:31:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:33,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829275673] [2025-02-08 13:31:33,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:31:33,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:31:33,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:33,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:33,622 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:31:33,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829275673] [2025-02-08 13:31:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829275673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:33,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836752525] [2025-02-08 13:31:33,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:33,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:33,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:33,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:33,624 INFO L87 Difference]: Start difference. First operand 49 states and 53 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:31:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:33,651 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-02-08 13:31:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:33,651 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:31:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:33,653 INFO L225 Difference]: With dead ends: 49 [2025-02-08 13:31:33,653 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 13:31:33,653 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:31:33,654 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 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:31:33,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 13:31:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-02-08 13:31:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 42 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:31:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-02-08 13:31:33,662 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 7 [2025-02-08 13:31:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:33,662 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-02-08 13:31:33,663 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:31:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-02-08 13:31:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:31:33,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:33,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:33,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:31:33,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:33,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:33,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1037024321, now seen corresponding path program 1 times [2025-02-08 13:31:33,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:33,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221422406] [2025-02-08 13:31:33,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:33,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:33,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:31:33,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:31:33,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:33,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:33,847 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:31:33,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:33,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221422406] [2025-02-08 13:31:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221422406] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:33,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426621244] [2025-02-08 13:31:33,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:33,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:33,850 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:31:33,851 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:31:33,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:31:34,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:31:34,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:34,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:34,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:34,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:34,095 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:31:34,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426621244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:34,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:34,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:31:34,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388545671] [2025-02-08 13:31:34,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:34,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:34,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:34,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:34,097 INFO L87 Difference]: Start difference. First operand 46 states and 50 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:31:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:34,139 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-02-08 13:31:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:34,147 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:31:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:34,148 INFO L225 Difference]: With dead ends: 46 [2025-02-08 13:31:34,148 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 13:31:34,148 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:31:34,149 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 50 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:31:34,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 50 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 13:31:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 13:31:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 40 states have internal predecessors, (45), 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:31:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-02-08 13:31:34,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 11 [2025-02-08 13:31:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:34,157 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-02-08 13:31:34,157 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:31:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-02-08 13:31:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:31:34,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:34,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:34,167 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:31:34,358 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:31:34,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:34,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:34,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2082983022, now seen corresponding path program 1 times [2025-02-08 13:31:34,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:34,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505557853] [2025-02-08 13:31:34,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:34,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:31:34,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:31:34,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:34,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:34,519 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:31:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505557853] [2025-02-08 13:31:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505557853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736250597] [2025-02-08 13:31:34,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:34,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:34,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:34,526 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:31:34,527 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:31:34,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:31:34,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:31:34,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:34,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:34,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:34,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:34,757 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:31:34,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:34,779 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:31:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736250597] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:34,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:31:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036205219] [2025-02-08 13:31:34,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:34,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:34,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:34,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:34,780 INFO L87 Difference]: Start difference. First operand 44 states and 48 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:31:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:34,807 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2025-02-08 13:31:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:34,808 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:31:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:34,809 INFO L225 Difference]: With dead ends: 92 [2025-02-08 13:31:34,809 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 13:31:34,809 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:31:34,809 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:34,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 13:31:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-08 13:31:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 49 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:31:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-02-08 13:31:34,813 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 12 [2025-02-08 13:31:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:34,813 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-02-08 13:31:34,813 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:31:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-02-08 13:31:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:31:34,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:34,814 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:34,825 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:31:35,018 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:31:35,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:35,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2113194023, now seen corresponding path program 2 times [2025-02-08 13:31:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532700246] [2025-02-08 13:31:35,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:35,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:31:35,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:31:35,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:35,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:35,270 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:31:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532700246] [2025-02-08 13:31:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532700246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:35,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:35,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:31:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294823002] [2025-02-08 13:31:35,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:35,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:31:35,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:35,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:31:35,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:35,272 INFO L87 Difference]: Start difference. First operand 53 states and 57 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:31:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:35,322 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2025-02-08 13:31:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:31:35,323 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:31:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:35,323 INFO L225 Difference]: With dead ends: 53 [2025-02-08 13:31:35,324 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 13:31:35,324 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:31:35,324 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 116 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:31:35,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 116 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 13:31:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 13:31:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 47 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:31:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2025-02-08 13:31:35,331 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 21 [2025-02-08 13:31:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:35,332 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2025-02-08 13:31:35,332 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:31:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2025-02-08 13:31:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:31:35,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:35,334 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:31:35,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:31:35,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:35,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1369870237, now seen corresponding path program 1 times [2025-02-08 13:31:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:35,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503187331] [2025-02-08 13:31:35,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:35,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:31:35,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:31:35,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:35,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:35,546 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:31:35,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503187331] [2025-02-08 13:31:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503187331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:35,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:31:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938474725] [2025-02-08 13:31:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:35,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:35,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:35,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:35,548 INFO L87 Difference]: Start difference. First operand 51 states and 55 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:31:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:35,581 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-02-08 13:31:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:35,581 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:31:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:35,582 INFO L225 Difference]: With dead ends: 82 [2025-02-08 13:31:35,582 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 13:31:35,582 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:31:35,583 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 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:31:35,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 13:31:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 13:31:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 50 states have internal predecessors, (55), 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:31:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-02-08 13:31:35,587 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 26 [2025-02-08 13:31:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:35,587 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-02-08 13:31:35,587 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:31:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-02-08 13:31:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:31:35,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:35,588 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:31:35,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:31:35,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:35,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:35,588 INFO L85 PathProgramCache]: Analyzing trace with hash 979914720, now seen corresponding path program 1 times [2025-02-08 13:31:35,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:35,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996469886] [2025-02-08 13:31:35,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:35,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:35,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:35,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:35,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:35,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:35,788 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:31:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996469886] [2025-02-08 13:31:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996469886] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385440480] [2025-02-08 13:31:35,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:35,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:35,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:35,791 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:31:35,792 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:31:35,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:36,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:36,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:36,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:36,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:31:36,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:36,109 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:31:36,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:36,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385440480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:36,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:36,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:31:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616449877] [2025-02-08 13:31:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:36,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:36,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:36,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:36,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:36,111 INFO L87 Difference]: Start difference. First operand 54 states and 58 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:31:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:36,147 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2025-02-08 13:31:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:36,147 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:31:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:36,148 INFO L225 Difference]: With dead ends: 54 [2025-02-08 13:31:36,148 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 13:31:36,149 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:31:36,149 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 69 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:31:36,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 69 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 13:31:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-08 13:31:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.2) internal successors, (54), 49 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:31:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-02-08 13:31:36,157 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 29 [2025-02-08 13:31:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:36,158 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-02-08 13:31:36,158 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:31:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-02-08 13:31:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:31:36,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:36,159 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:31:36,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:36,359 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:31:36,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:36,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash 979914880, now seen corresponding path program 1 times [2025-02-08 13:31:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754854893] [2025-02-08 13:31:36,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:36,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:36,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:36,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:36,548 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:31:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:36,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754854893] [2025-02-08 13:31:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754854893] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:36,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548829847] [2025-02-08 13:31:36,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:36,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:36,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:36,551 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:31:36,552 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:31:36,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:31:36,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:31:36,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:36,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:36,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:36,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:36,903 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:31:36,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:36,972 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:31:36,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548829847] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:36,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:36,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:31:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145497655] [2025-02-08 13:31:36,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:36,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:31:36,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:36,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:31:36,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:31:36,974 INFO L87 Difference]: Start difference. First operand 53 states and 57 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:31:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:37,084 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2025-02-08 13:31:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:31:37,085 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:31:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:37,086 INFO L225 Difference]: With dead ends: 109 [2025-02-08 13:31:37,086 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 13:31:37,086 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:31:37,086 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:37,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 233 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 13:31:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-08 13:31:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.126984126984127) internal successors, (71), 66 states have internal predecessors, (71), 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:31:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-02-08 13:31:37,090 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 29 [2025-02-08 13:31:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:37,094 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-02-08 13:31:37,094 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:31:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-02-08 13:31:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:31:37,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:37,098 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] [2025-02-08 13:31:37,107 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:31:37,298 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:31:37,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:37,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1620900672, now seen corresponding path program 1 times [2025-02-08 13:31:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:37,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413096036] [2025-02-08 13:31:37,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:37,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:37,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:31:37,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:31:37,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:37,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:31:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413096036] [2025-02-08 13:31:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413096036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:37,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:37,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977964358] [2025-02-08 13:31:37,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:37,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:37,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:37,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:37,535 INFO L87 Difference]: Start difference. First operand 70 states and 74 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:31:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:37,578 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2025-02-08 13:31:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:37,578 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:31:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:37,580 INFO L225 Difference]: With dead ends: 81 [2025-02-08 13:31:37,580 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 13:31:37,580 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:31:37,581 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:37,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 13:31:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2025-02-08 13:31:37,588 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:31:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-02-08 13:31:37,588 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 48 [2025-02-08 13:31:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:37,592 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-02-08 13:31:37,592 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:31:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-02-08 13:31:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:31:37,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:37,592 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:31:37,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:31:37,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:37,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1620895707, now seen corresponding path program 1 times [2025-02-08 13:31:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867380948] [2025-02-08 13:31:37,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:37,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:31:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:31:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:37,749 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:31:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867380948] [2025-02-08 13:31:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867380948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:37,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:37,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605588265] [2025-02-08 13:31:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:37,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:37,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:37,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:37,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:37,750 INFO L87 Difference]: Start difference. First operand 79 states and 86 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:31:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:37,774 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2025-02-08 13:31:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:37,774 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:31:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:37,775 INFO L225 Difference]: With dead ends: 79 [2025-02-08 13:31:37,775 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 13:31:37,775 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:31:37,776 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 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:31:37,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:31:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 13:31:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-02-08 13:31:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 70 states have internal predecessors, (77), 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:31:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-02-08 13:31:37,779 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 48 [2025-02-08 13:31:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:37,780 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-02-08 13:31:37,780 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:31:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-02-08 13:31:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 13:31:37,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:37,780 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] [2025-02-08 13:31:37,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:31:37,781 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:37,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash -947932178, now seen corresponding path program 1 times [2025-02-08 13:31:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:37,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179872324] [2025-02-08 13:31:37,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:37,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 13:31:37,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 13:31:37,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:37,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:38,157 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:31:38,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179872324] [2025-02-08 13:31:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179872324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:38,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:38,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:31:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693446246] [2025-02-08 13:31:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:31:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:38,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:31:38,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:38,159 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:31:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:38,263 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2025-02-08 13:31:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:31:38,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 52 [2025-02-08 13:31:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:38,264 INFO L225 Difference]: With dead ends: 74 [2025-02-08 13:31:38,264 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 13:31:38,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:38,265 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:38,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 13:31:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-08 13:31:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 64 states have internal predecessors, (70), 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:31:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2025-02-08 13:31:38,273 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 52 [2025-02-08 13:31:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:38,273 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2025-02-08 13:31:38,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:31:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2025-02-08 13:31:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 13:31:38,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:38,274 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] [2025-02-08 13:31:38,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:31:38,274 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:38,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1800405818, now seen corresponding path program 1 times [2025-02-08 13:31:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380070143] [2025-02-08 13:31:38,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:38,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 13:31:38,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 13:31:38,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:38,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:38,639 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:31:38,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:38,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380070143] [2025-02-08 13:31:38,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380070143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:38,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:38,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:31:38,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783871766] [2025-02-08 13:31:38,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:38,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:31:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:38,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:31:38,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:38,641 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:31:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:38,701 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2025-02-08 13:31:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) Word has length 53 [2025-02-08 13:31:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:38,702 INFO L225 Difference]: With dead ends: 80 [2025-02-08 13:31:38,702 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 13:31:38,702 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:31:38,703 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:38,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 88 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 13:31:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-08 13:31:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 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:31:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-02-08 13:31:38,707 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 53 [2025-02-08 13:31:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:38,707 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-02-08 13:31:38,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:31:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-02-08 13:31:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:31:38,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:38,712 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:31:38,712 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1100817531, now seen corresponding path program 1 times [2025-02-08 13:31:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294588479] [2025-02-08 13:31:38,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:38,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:31:38,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:31:38,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:38,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:31:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294588479] [2025-02-08 13:31:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294588479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139834327] [2025-02-08 13:31:38,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:38,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:38,894 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:31:38,895 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:31:39,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:31:39,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:31:39,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:39,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:39,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:39,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:31:39,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:31:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139834327] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:39,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:31:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468747211] [2025-02-08 13:31:39,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:39,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:31:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:39,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:31:39,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:31:39,243 INFO L87 Difference]: Start difference. First operand 68 states and 72 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:31:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:39,300 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2025-02-08 13:31:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:39,301 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 55 [2025-02-08 13:31:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:39,302 INFO L225 Difference]: With dead ends: 108 [2025-02-08 13:31:39,302 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 13:31:39,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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:31:39,302 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:39,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 13:31:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-08 13:31:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 82 states have internal predecessors, (87), 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:31:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-02-08 13:31:39,306 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 55 [2025-02-08 13:31:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:39,306 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-02-08 13:31:39,306 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:31:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-02-08 13:31:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 13:31:39,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:39,307 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, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:39,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:39,507 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,SelfDestructingSolverStorable13 [2025-02-08 13:31:39,508 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:39,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1010068610, now seen corresponding path program 1 times [2025-02-08 13:31:39,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:39,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301363489] [2025-02-08 13:31:39,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:39,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 13:31:39,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 13:31:39,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:39,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:39,746 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:31:39,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301363489] [2025-02-08 13:31:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301363489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218915142] [2025-02-08 13:31:39,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:39,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:39,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:39,749 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:31:39,750 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:31:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 13:31:40,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 13:31:40,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:40,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:40,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:40,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:40,171 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:31:40,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:40,234 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:31:40,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218915142] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:40,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:40,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:31:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330453635] [2025-02-08 13:31:40,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:31:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:40,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:31:40,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:31:40,236 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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:31:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:40,307 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2025-02-08 13:31:40,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:31:40,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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) Word has length 69 [2025-02-08 13:31:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:40,309 INFO L225 Difference]: With dead ends: 153 [2025-02-08 13:31:40,309 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 13:31:40,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 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:31:40,310 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:40,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:31:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 13:31:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-02-08 13:31:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0512820512820513) internal successors, (123), 118 states have internal predecessors, (123), 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:31:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2025-02-08 13:31:40,318 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 69 [2025-02-08 13:31:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:40,319 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2025-02-08 13:31:40,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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:31:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2025-02-08 13:31:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 13:31:40,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:40,319 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, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:40,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 13:31:40,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:40,520 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-02-08 13:31:40,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1274155298, now seen corresponding path program 2 times [2025-02-08 13:31:40,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:40,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472884168] [2025-02-08 13:31:40,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:40,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-08 13:31:40,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 13:31:40,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:31:40,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:45,124 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:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:45,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472884168] [2025-02-08 13:31:45,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472884168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:45,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345750877] [2025-02-08 13:31:45,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:45,127 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:31:45,129 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:31:45,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-08 13:31:45,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 13:31:45,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:31:45,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:45,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 1617 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-08 13:31:45,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:45,899 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:45,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 13:31:45,940 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 13:31:45,941 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:45,949 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 15 treesize of output 11 [2025-02-08 13:31:46,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:46,008 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 122 treesize of output 84 [2025-02-08 13:31:46,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:46,039 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,041 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 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-08 13:31:46,078 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:46,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:46,084 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 36 treesize of output 38 [2025-02-08 13:31:46,090 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 28 treesize of output 15 [2025-02-08 13:31:46,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:46,106 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 156 treesize of output 110 [2025-02-08 13:31:46,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:46,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:46,121 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 162 treesize of output 116 [2025-02-08 13:31:46,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:46,133 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 51 treesize of output 53 [2025-02-08 13:31:46,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:31:46,150 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2025-02-08 13:31:46,150 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 2 case distinctions, treesize of input 71 treesize of output 1 [2025-02-08 13:31:46,188 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,188 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 52 treesize of output 47 [2025-02-08 13:31:46,195 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 28 treesize of output 15 [2025-02-08 13:31:46,250 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,251 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 52 treesize of output 47 [2025-02-08 13:31:46,269 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 28 treesize of output 15 [2025-02-08 13:31:46,320 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,320 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 52 treesize of output 47 [2025-02-08 13:31:46,330 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 28 treesize of output 15 [2025-02-08 13:31:46,380 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,381 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 52 treesize of output 47 [2025-02-08 13:31:46,386 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 28 treesize of output 15 [2025-02-08 13:31:46,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,437 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 52 treesize of output 47 [2025-02-08 13:31:46,444 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 28 treesize of output 15 [2025-02-08 13:31:46,479 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,480 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 52 treesize of output 47 [2025-02-08 13:31:46,490 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 28 treesize of output 15 [2025-02-08 13:31:46,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,529 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 52 treesize of output 47 [2025-02-08 13:31:46,533 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 28 treesize of output 15 [2025-02-08 13:31:46,581 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,581 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 52 treesize of output 47 [2025-02-08 13:31:46,585 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 28 treesize of output 15 [2025-02-08 13:31:46,625 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,626 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 52 treesize of output 47 [2025-02-08 13:31:46,632 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 28 treesize of output 15 [2025-02-08 13:31:46,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 13:31:46,668 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 52 treesize of output 47 [2025-02-08 13:31:46,674 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 28 treesize of output 15 [2025-02-08 13:31:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-08 13:31:46,750 INFO L312 TraceCheckSpWp]: Computing backward predicates...