./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/wc-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/wc-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0965f22672c6a292fec01d227f055efac5960ba3033d74ae9dd8eaa6c3af30ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:04:18,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:04:18,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 18:04:18,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:04:18,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:04:18,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:04:18,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:04:18,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:04:18,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:04:18,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:04:18,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:04:18,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:04:18,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:04:18,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:04:18,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:04:18,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:04:18,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:04:18,155 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 -> 0965f22672c6a292fec01d227f055efac5960ba3033d74ae9dd8eaa6c3af30ea [2025-02-06 18:04:18,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:04:18,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:04:18,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:04:18,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:04:18,405 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:04:18,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/wc-1.i [2025-02-06 18:04:19,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6820e66f3/ea01e49251d742b68c00d592606d9a8c/FLAGf836a2163 [2025-02-06 18:04:20,437 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:04:20,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/wc-1.i [2025-02-06 18:04:20,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6820e66f3/ea01e49251d742b68c00d592606d9a8c/FLAGf836a2163 [2025-02-06 18:04:20,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6820e66f3/ea01e49251d742b68c00d592606d9a8c [2025-02-06 18:04:20,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:04:20,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:04:20,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:04:20,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:04:20,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:04:20,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:04:20" (1/1) ... [2025-02-06 18:04:20,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54eebe7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:20, skipping insertion in model container [2025-02-06 18:04:20,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:04:20" (1/1) ... [2025-02-06 18:04:20,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:04:21,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:04:21,554 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:04:21,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:04:21,858 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:04:21,863 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:04:21,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21 WrapperNode [2025-02-06 18:04:21,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:04:21,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:04:21,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:04:21,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:04:21,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:21,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:21,997 INFO L138 Inliner]: procedures = 577, calls = 807, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 2177 [2025-02-06 18:04:21,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:04:21,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:04:21,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:04:21,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:04:22,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,044 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:04:22,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:04:22,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:04:22,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:04:22,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:04:22,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:04:22,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:22,210 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-06 18:04:22,218 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-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 18:04:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:04:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:04:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:04:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:04:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-06 18:04:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-06 18:04:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:04:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:04:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-06 18:04:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-06 18:04:22,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-06 18:04:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-06 18:04:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:04:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:04:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:04:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:04:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 18:04:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 18:04:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 18:04:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 18:04:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 18:04:22,596 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:04:22,598 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:04:28,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2911: call ULTIMATE.dealloc(__main_~#counts~0#1.base, __main_~#counts~0#1.offset);havoc __main_~#counts~0#1.base, __main_~#counts~0#1.offset;call ULTIMATE.dealloc(__main_~#totals~0#1.base, __main_~#totals~0#1.offset);havoc __main_~#totals~0#1.base, __main_~#totals~0#1.offset; [2025-02-06 18:04:28,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: havoc getopt_long_#t~ret291#1; [2025-02-06 18:04:28,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: havoc __main_~return_value_ferror$2~0#1; [2025-02-06 18:04:28,148 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164: havoc _IO_getc_#t~nondet262#1; [2025-02-06 18:04:28,148 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc fclose_if_not_stdin_#t~bitwise74#1; [2025-02-06 18:04:28,148 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-06 18:04:28,409 INFO L? ?]: Removed 671 outVars from TransFormulas that were not future-live. [2025-02-06 18:04:28,409 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:04:28,484 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:04:28,484 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:04:28,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:04:28 BoogieIcfgContainer [2025-02-06 18:04:28,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:04:28,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:04:28,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:04:28,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:04:28,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:04:20" (1/3) ... [2025-02-06 18:04:28,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c521800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:04:28, skipping insertion in model container [2025-02-06 18:04:28,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21" (2/3) ... [2025-02-06 18:04:28,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c521800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:04:28, skipping insertion in model container [2025-02-06 18:04:28,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:04:28" (3/3) ... [2025-02-06 18:04:28,497 INFO L128 eAbstractionObserver]: Analyzing ICFG wc-1.i [2025-02-06 18:04:28,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:04:28,518 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wc-1.i that has 8 procedures, 592 locations, 1 initial locations, 33 loop locations, and 74 error locations. [2025-02-06 18:04:28,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:04:28,620 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;@4498c1aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:04:28,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-02-06 18:04:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 592 states, 488 states have (on average 1.653688524590164) internal successors, (807), 564 states have internal predecessors, (807), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 18:04:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:04:28,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:28,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:04:28,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:28,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash 30844543, now seen corresponding path program 1 times [2025-02-06 18:04:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244728844] [2025-02-06 18:04:28,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:28,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:29,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:04:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:04:29,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:29,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:29,901 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-06 18:04:29,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:29,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244728844] [2025-02-06 18:04:29,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244728844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:29,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:29,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:29,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546464194] [2025-02-06 18:04:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:29,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:29,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:29,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:29,922 INFO L87 Difference]: Start difference. First operand has 592 states, 488 states have (on average 1.653688524590164) internal successors, (807), 564 states have internal predecessors, (807), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-06 18:04:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:30,118 INFO L93 Difference]: Finished difference Result 1071 states and 1576 transitions. [2025-02-06 18:04:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:30,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-06 18:04:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:30,132 INFO L225 Difference]: With dead ends: 1071 [2025-02-06 18:04:30,132 INFO L226 Difference]: Without dead ends: 482 [2025-02-06 18:04:30,138 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-06 18:04:30,142 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 1 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:30,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1296 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-06 18:04:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-02-06 18:04:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 413 states have (on average 1.569007263922518) internal successors, (648), 462 states have internal predecessors, (648), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 679 transitions. [2025-02-06 18:04:30,203 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 679 transitions. Word has length 4 [2025-02-06 18:04:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:30,203 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 679 transitions. [2025-02-06 18:04:30,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-06 18:04:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 679 transitions. [2025-02-06 18:04:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:04:30,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:30,204 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:04:30,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:04:30,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:30,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash -232291257, now seen corresponding path program 1 times [2025-02-06 18:04:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:30,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077781509] [2025-02-06 18:04:30,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:30,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:04:30,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:04:30,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:30,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:30,936 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-06 18:04:30,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:30,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077781509] [2025-02-06 18:04:30,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077781509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047711743] [2025-02-06 18:04:30,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:30,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:30,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:30,941 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-06 18:04:30,943 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-06 18:04:31,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:04:31,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:04:31,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:31,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:31,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:31,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:31,642 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-06 18:04:31,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:31,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047711743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:31,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:04:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972887464] [2025-02-06 18:04:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:31,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:31,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:31,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:31,644 INFO L87 Difference]: Start difference. First operand 482 states and 679 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-06 18:04:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:31,734 INFO L93 Difference]: Finished difference Result 482 states and 679 transitions. [2025-02-06 18:04:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:04:31,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-06 18:04:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:31,737 INFO L225 Difference]: With dead ends: 482 [2025-02-06 18:04:31,737 INFO L226 Difference]: Without dead ends: 481 [2025-02-06 18:04:31,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-06 18:04:31,738 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 1 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:31,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1289 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-06 18:04:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-02-06 18:04:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 413 states have (on average 1.5665859564164648) internal successors, (647), 461 states have internal predecessors, (647), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 678 transitions. [2025-02-06 18:04:31,752 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 678 transitions. Word has length 7 [2025-02-06 18:04:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:31,752 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 678 transitions. [2025-02-06 18:04:31,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-06 18:04:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 678 transitions. [2025-02-06 18:04:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:04:31,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:31,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:04:31,764 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-06 18:04:31,953 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-06 18:04:31,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:31,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1388906561, now seen corresponding path program 1 times [2025-02-06 18:04:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:31,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695022181] [2025-02-06 18:04:31,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:32,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:04:32,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:04:32,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:32,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:32,546 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-06 18:04:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:32,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695022181] [2025-02-06 18:04:32,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695022181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:32,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:32,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276447139] [2025-02-06 18:04:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:32,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:32,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:32,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:32,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:32,548 INFO L87 Difference]: Start difference. First operand 481 states and 678 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-06 18:04:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:32,704 INFO L93 Difference]: Finished difference Result 481 states and 678 transitions. [2025-02-06 18:04:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:32,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-06 18:04:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:32,707 INFO L225 Difference]: With dead ends: 481 [2025-02-06 18:04:32,708 INFO L226 Difference]: Without dead ends: 480 [2025-02-06 18:04:32,708 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-06 18:04:32,709 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 0 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:32,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1290 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-06 18:04:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2025-02-06 18:04:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 411 states have (on average 1.5669099756690998) internal successors, (644), 458 states have internal predecessors, (644), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 675 transitions. [2025-02-06 18:04:32,729 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 675 transitions. Word has length 8 [2025-02-06 18:04:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:32,729 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 675 transitions. [2025-02-06 18:04:32,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-06 18:04:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 675 transitions. [2025-02-06 18:04:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 18:04:32,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:32,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:32,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:04:32,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:32,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1340797925, now seen corresponding path program 1 times [2025-02-06 18:04:32,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272894096] [2025-02-06 18:04:32,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:33,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:04:33,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:04:33,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:33,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:33,410 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-06 18:04:33,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272894096] [2025-02-06 18:04:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272894096] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347085518] [2025-02-06 18:04:33,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:33,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:33,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:33,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:04:33,420 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-06 18:04:34,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:04:34,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:04:34,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:34,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:34,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:04:34,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:34,318 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-06 18:04:34,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:34,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347085518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:34,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:34,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 18:04:34,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070325873] [2025-02-06 18:04:34,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:34,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:34,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:34,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:34,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:34,321 INFO L87 Difference]: Start difference. First operand 478 states and 675 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-06 18:04:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:34,496 INFO L93 Difference]: Finished difference Result 478 states and 675 transitions. [2025-02-06 18:04:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:34,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 12 [2025-02-06 18:04:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:34,499 INFO L225 Difference]: With dead ends: 478 [2025-02-06 18:04:34,501 INFO L226 Difference]: Without dead ends: 476 [2025-02-06 18:04:34,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-06 18:04:34,503 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 595 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:34,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 700 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-06 18:04:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2025-02-06 18:04:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 411 states have (on average 1.562043795620438) internal successors, (642), 456 states have internal predecessors, (642), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 673 transitions. [2025-02-06 18:04:34,530 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 673 transitions. Word has length 12 [2025-02-06 18:04:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:34,531 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 673 transitions. [2025-02-06 18:04:34,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-06 18:04:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 673 transitions. [2025-02-06 18:04:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 18:04:34,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:34,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:34,549 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-06 18:04:34,737 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-06 18:04:34,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:34,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1384936355, now seen corresponding path program 1 times [2025-02-06 18:04:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:34,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661036931] [2025-02-06 18:04:34,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:35,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:04:35,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:04:35,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:35,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:35,434 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-06 18:04:35,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661036931] [2025-02-06 18:04:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661036931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343668860] [2025-02-06 18:04:35,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:35,436 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-06 18:04:35,445 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-06 18:04:35,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:04:36,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:04:36,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:36,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:36,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:36,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:36,085 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-06 18:04:36,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:36,124 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-06 18:04:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343668860] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:36,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:04:36,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208991883] [2025-02-06 18:04:36,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:36,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:36,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:36,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:36,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:36,130 INFO L87 Difference]: Start difference. First operand 476 states and 673 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-06 18:04:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:36,289 INFO L93 Difference]: Finished difference Result 955 states and 1351 transitions. [2025-02-06 18:04:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:36,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 13 [2025-02-06 18:04:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:36,292 INFO L225 Difference]: With dead ends: 955 [2025-02-06 18:04:36,292 INFO L226 Difference]: Without dead ends: 485 [2025-02-06 18:04:36,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-06 18:04:36,294 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 4 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:36,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2570 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-02-06 18:04:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-02-06 18:04:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 420 states have (on average 1.55) internal successors, (651), 465 states have internal predecessors, (651), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 682 transitions. [2025-02-06 18:04:36,304 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 682 transitions. Word has length 13 [2025-02-06 18:04:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:36,304 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 682 transitions. [2025-02-06 18:04:36,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-06 18:04:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 682 transitions. [2025-02-06 18:04:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:04:36,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:36,305 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:36,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:04:36,505 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-06 18:04:36,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:36,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:36,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1319434901, now seen corresponding path program 2 times [2025-02-06 18:04:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:36,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833478188] [2025-02-06 18:04:36,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:36,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 18:04:36,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 18:04:36,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:04:36,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:37,012 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-06 18:04:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833478188] [2025-02-06 18:04:37,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833478188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:37,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:37,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:04:37,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842452378] [2025-02-06 18:04:37,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:37,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:04:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:37,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:04:37,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:37,014 INFO L87 Difference]: Start difference. First operand 485 states and 682 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-06 18:04:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:37,133 INFO L93 Difference]: Finished difference Result 485 states and 682 transitions. [2025-02-06 18:04:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:04:37,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-02-06 18:04:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:37,135 INFO L225 Difference]: With dead ends: 485 [2025-02-06 18:04:37,135 INFO L226 Difference]: Without dead ends: 483 [2025-02-06 18:04:37,136 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-06 18:04:37,137 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 594 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:37,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1961 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:37,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-02-06 18:04:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-02-06 18:04:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 420 states have (on average 1.5452380952380953) internal successors, (649), 463 states have internal predecessors, (649), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 680 transitions. [2025-02-06 18:04:37,157 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 680 transitions. Word has length 22 [2025-02-06 18:04:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:37,157 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 680 transitions. [2025-02-06 18:04:37,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-06 18:04:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 680 transitions. [2025-02-06 18:04:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 18:04:37,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:37,157 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:37,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:04:37,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:37,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash 108101896, now seen corresponding path program 1 times [2025-02-06 18:04:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3367841] [2025-02-06 18:04:37,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:37,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 18:04:37,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 18:04:37,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:37,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:37,609 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-06 18:04:37,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3367841] [2025-02-06 18:04:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3367841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:37,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:37,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:04:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654980081] [2025-02-06 18:04:37,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:37,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:37,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:37,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:37,615 INFO L87 Difference]: Start difference. First operand 483 states and 680 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 18:04:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:37,695 INFO L93 Difference]: Finished difference Result 949 states and 1344 transitions. [2025-02-06 18:04:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:37,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 27 [2025-02-06 18:04:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:37,698 INFO L225 Difference]: With dead ends: 949 [2025-02-06 18:04:37,698 INFO L226 Difference]: Without dead ends: 486 [2025-02-06 18:04:37,699 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-06 18:04:37,700 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 2 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:37,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1279 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-06 18:04:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2025-02-06 18:04:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 423 states have (on average 1.541371158392435) internal successors, (652), 466 states have internal predecessors, (652), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 683 transitions. [2025-02-06 18:04:37,718 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 683 transitions. Word has length 27 [2025-02-06 18:04:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:37,719 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 683 transitions. [2025-02-06 18:04:37,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-06 18:04:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 683 transitions. [2025-02-06 18:04:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:04:37,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:37,720 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, 1] [2025-02-06 18:04:37,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:04:37,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:37,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1082580530, now seen corresponding path program 1 times [2025-02-06 18:04:37,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:37,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403499034] [2025-02-06 18:04:37,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:37,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:04:37,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:04:37,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:37,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:38,176 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-06 18:04:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403499034] [2025-02-06 18:04:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403499034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:38,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949363818] [2025-02-06 18:04:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:38,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:38,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:38,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:38,178 INFO L87 Difference]: Start difference. First operand 486 states and 683 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-06 18:04:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:38,287 INFO L93 Difference]: Finished difference Result 785 states and 1122 transitions. [2025-02-06 18:04:38,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:38,288 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 30 [2025-02-06 18:04:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:38,290 INFO L225 Difference]: With dead ends: 785 [2025-02-06 18:04:38,290 INFO L226 Difference]: Without dead ends: 783 [2025-02-06 18:04:38,291 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-06 18:04:38,291 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 413 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:38,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1266 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-02-06 18:04:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 490. [2025-02-06 18:04:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 427 states have (on average 1.5386416861826697) internal successors, (657), 470 states have internal predecessors, (657), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 688 transitions. [2025-02-06 18:04:38,307 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 688 transitions. Word has length 30 [2025-02-06 18:04:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:38,307 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 688 transitions. [2025-02-06 18:04:38,307 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-06 18:04:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 688 transitions. [2025-02-06 18:04:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:04:38,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:38,308 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, 1] [2025-02-06 18:04:38,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:04:38,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:38,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -756208178, now seen corresponding path program 1 times [2025-02-06 18:04:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142175237] [2025-02-06 18:04:38,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:38,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:04:38,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:04:38,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:38,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:38,775 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-06 18:04:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142175237] [2025-02-06 18:04:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142175237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:38,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:38,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80046207] [2025-02-06 18:04:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:38,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:38,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:38,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:38,778 INFO L87 Difference]: Start difference. First operand 490 states and 688 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-06 18:04:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:38,865 INFO L93 Difference]: Finished difference Result 503 states and 703 transitions. [2025-02-06 18:04:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:38,865 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 30 [2025-02-06 18:04:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:38,868 INFO L225 Difference]: With dead ends: 503 [2025-02-06 18:04:38,868 INFO L226 Difference]: Without dead ends: 501 [2025-02-06 18:04:38,868 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-06 18:04:38,868 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 3 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:38,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1276 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-06 18:04:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2025-02-06 18:04:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 436 states have (on average 1.536697247706422) internal successors, (670), 479 states have internal predecessors, (670), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 701 transitions. [2025-02-06 18:04:38,882 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 701 transitions. Word has length 30 [2025-02-06 18:04:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:38,883 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 701 transitions. [2025-02-06 18:04:38,883 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-06 18:04:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 701 transitions. [2025-02-06 18:04:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:04:38,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:38,886 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:38,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:04:38,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:38,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash -756208018, now seen corresponding path program 1 times [2025-02-06 18:04:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:38,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841772356] [2025-02-06 18:04:38,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:39,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:04:39,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:04:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:39,345 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-06 18:04:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841772356] [2025-02-06 18:04:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841772356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079657631] [2025-02-06 18:04:39,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:39,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:39,351 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-06 18:04:39,356 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-06 18:04:40,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:04:40,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:04:40,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:40,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:40,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:04:40,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:40,476 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-06 18:04:40,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:40,671 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-06 18:04:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079657631] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:40,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:40,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:04:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060697104] [2025-02-06 18:04:40,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:40,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:04:40,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:40,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:04:40,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:04:40,673 INFO L87 Difference]: Start difference. First operand 499 states and 701 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-06 18:04:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:41,126 INFO L93 Difference]: Finished difference Result 1000 states and 1410 transitions. [2025-02-06 18:04:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:04:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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 30 [2025-02-06 18:04:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:41,129 INFO L225 Difference]: With dead ends: 1000 [2025-02-06 18:04:41,129 INFO L226 Difference]: Without dead ends: 516 [2025-02-06 18:04:41,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:04:41,131 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 5 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:41,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3172 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:04:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-06 18:04:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-02-06 18:04:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 454 states have (on average 1.5110132158590308) internal successors, (686), 496 states have internal predecessors, (686), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 717 transitions. [2025-02-06 18:04:41,145 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 717 transitions. Word has length 30 [2025-02-06 18:04:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:41,146 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 717 transitions. [2025-02-06 18:04:41,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-06 18:04:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 717 transitions. [2025-02-06 18:04:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:04:41,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:41,146 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:41,159 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-06 18:04:41,347 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,SelfDestructingSolverStorable9 [2025-02-06 18:04:41,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:41,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2080596458, now seen corresponding path program 1 times [2025-02-06 18:04:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:41,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576720591] [2025-02-06 18:04:41,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:41,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:41,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:04:41,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:04:41,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:41,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:41,863 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-06 18:04:41,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576720591] [2025-02-06 18:04:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576720591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:41,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447808038] [2025-02-06 18:04:41,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:41,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:41,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:41,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:41,868 INFO L87 Difference]: Start difference. First operand 516 states and 717 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-06 18:04:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:41,994 INFO L93 Difference]: Finished difference Result 516 states and 717 transitions. [2025-02-06 18:04:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:41,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-02-06 18:04:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:41,999 INFO L225 Difference]: With dead ends: 516 [2025-02-06 18:04:41,999 INFO L226 Difference]: Without dead ends: 515 [2025-02-06 18:04:41,999 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-06 18:04:42,000 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 0 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:42,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1277 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-06 18:04:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2025-02-06 18:04:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 450 states have (on average 1.511111111111111) internal successors, (680), 491 states have internal predecessors, (680), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 711 transitions. [2025-02-06 18:04:42,020 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 711 transitions. Word has length 49 [2025-02-06 18:04:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:42,021 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 711 transitions. [2025-02-06 18:04:42,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-06 18:04:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 711 transitions. [2025-02-06 18:04:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 18:04:42,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:42,023 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:42,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:04:42,023 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:42,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1573249838, now seen corresponding path program 1 times [2025-02-06 18:04:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:42,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432905548] [2025-02-06 18:04:42,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:42,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 18:04:42,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 18:04:42,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:42,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:04:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432905548] [2025-02-06 18:04:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432905548] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203810147] [2025-02-06 18:04:42,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:42,676 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-06 18:04:42,677 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-06 18:04:43,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 18:04:43,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 18:04:43,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:43,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:43,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1883 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:43,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:04:43,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:43,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203810147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:43,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:43,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:04:43,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638279763] [2025-02-06 18:04:43,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:43,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:43,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:43,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:43,444 INFO L87 Difference]: Start difference. First operand 511 states and 711 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-06 18:04:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:43,641 INFO L93 Difference]: Finished difference Result 808 states and 1148 transitions. [2025-02-06 18:04:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:04:43,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-06 18:04:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:43,645 INFO L225 Difference]: With dead ends: 808 [2025-02-06 18:04:43,645 INFO L226 Difference]: Without dead ends: 807 [2025-02-06 18:04:43,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-06 18:04:43,646 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 825 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:43,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1676 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-02-06 18:04:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 510. [2025-02-06 18:04:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 450 states have (on average 1.508888888888889) internal successors, (679), 490 states have internal predecessors, (679), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 710 transitions. [2025-02-06 18:04:43,664 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 710 transitions. Word has length 52 [2025-02-06 18:04:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:43,664 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 710 transitions. [2025-02-06 18:04:43,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-06 18:04:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 710 transitions. [2025-02-06 18:04:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 18:04:43,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:43,665 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:43,676 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-06 18:04:43,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 18:04:43,866 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:43,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:43,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1526103850, now seen corresponding path program 1 times [2025-02-06 18:04:43,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:43,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015016202] [2025-02-06 18:04:43,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:43,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:44,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 18:04:44,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 18:04:44,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:44,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:04:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:44,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015016202] [2025-02-06 18:04:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015016202] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969776341] [2025-02-06 18:04:44,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:44,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:44,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:44,408 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-06 18:04:44,409 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-06 18:04:45,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 18:04:45,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 18:04:45,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:45,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:45,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:45,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:04:45,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:04:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969776341] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:45,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 18:04:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727063962] [2025-02-06 18:04:45,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:45,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:45,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:45,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:45,318 INFO L87 Difference]: Start difference. First operand 510 states and 710 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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-06 18:04:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:45,819 INFO L93 Difference]: Finished difference Result 1695 states and 2456 transitions. [2025-02-06 18:04:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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 53 [2025-02-06 18:04:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:45,826 INFO L225 Difference]: With dead ends: 1695 [2025-02-06 18:04:45,827 INFO L226 Difference]: Without dead ends: 1694 [2025-02-06 18:04:45,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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-06 18:04:45,828 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 2472 mSDsluCounter, 2936 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2500 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:45,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2500 Valid, 3570 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:04:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-02-06 18:04:45,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 522. [2025-02-06 18:04:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 462 states have (on average 1.5021645021645023) internal successors, (694), 502 states have internal predecessors, (694), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 725 transitions. [2025-02-06 18:04:45,852 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 725 transitions. Word has length 53 [2025-02-06 18:04:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:45,853 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 725 transitions. [2025-02-06 18:04:45,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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-06 18:04:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 725 transitions. [2025-02-06 18:04:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 18:04:45,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:45,854 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:45,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:04:46,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 18:04:46,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash 778973568, now seen corresponding path program 1 times [2025-02-06 18:04:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:46,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560439911] [2025-02-06 18:04:46,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:46,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:46,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:04:46,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:04:46,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:46,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:04:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:46,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560439911] [2025-02-06 18:04:46,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560439911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:46,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779668659] [2025-02-06 18:04:46,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:46,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:46,495 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-06 18:04:46,496 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-06 18:04:47,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:04:47,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:04:47,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:47,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:47,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:47,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:04:47,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:04:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779668659] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:47,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:47,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:04:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616034263] [2025-02-06 18:04:47,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:47,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:47,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:47,405 INFO L87 Difference]: Start difference. First operand 522 states and 725 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-06 18:04:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:47,522 INFO L93 Difference]: Finished difference Result 1019 states and 1427 transitions. [2025-02-06 18:04:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:47,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-06 18:04:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:47,524 INFO L225 Difference]: With dead ends: 1019 [2025-02-06 18:04:47,524 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 18:04:47,525 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-06 18:04:47,526 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 4 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:47,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1911 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 18:04:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-02-06 18:04:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 480 states have (on average 1.4833333333333334) internal successors, (712), 520 states have internal predecessors, (712), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 743 transitions. [2025-02-06 18:04:47,539 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 743 transitions. Word has length 55 [2025-02-06 18:04:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 743 transitions. [2025-02-06 18:04:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-06 18:04:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 743 transitions. [2025-02-06 18:04:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 18:04:47,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:47,540 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:47,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 18:04:47,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:47,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:47,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash 862056126, now seen corresponding path program 1 times [2025-02-06 18:04:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:47,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268680247] [2025-02-06 18:04:47,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:47,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 18:04:48,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 18:04:48,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:48,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:48,135 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-06 18:04:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268680247] [2025-02-06 18:04:48,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268680247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745285660] [2025-02-06 18:04:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:48,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:48,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:48,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:48,137 INFO L87 Difference]: Start difference. First operand 540 states and 743 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:04:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:48,271 INFO L93 Difference]: Finished difference Result 1056 states and 1482 transitions. [2025-02-06 18:04:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2025-02-06 18:04:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:48,274 INFO L225 Difference]: With dead ends: 1056 [2025-02-06 18:04:48,274 INFO L226 Difference]: Without dead ends: 636 [2025-02-06 18:04:48,275 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-06 18:04:48,276 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 120 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:48,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1224 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-02-06 18:04:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 582. [2025-02-06 18:04:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 521 states have (on average 1.4740882917466411) internal successors, (768), 561 states have internal predecessors, (768), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 18:04:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 801 transitions. [2025-02-06 18:04:48,289 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 801 transitions. Word has length 62 [2025-02-06 18:04:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:48,289 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 801 transitions. [2025-02-06 18:04:48,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:04:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 801 transitions. [2025-02-06 18:04:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 18:04:48,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:48,290 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:48,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:04:48,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:48,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash -492723908, now seen corresponding path program 1 times [2025-02-06 18:04:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:48,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520062444] [2025-02-06 18:04:48,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:48,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:48,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 18:04:48,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 18:04:48,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:48,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:48,737 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-06 18:04:48,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520062444] [2025-02-06 18:04:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520062444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:48,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:48,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:48,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617072756] [2025-02-06 18:04:48,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:48,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:48,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:48,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:48,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:48,738 INFO L87 Difference]: Start difference. First operand 582 states and 801 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:48,961 INFO L93 Difference]: Finished difference Result 584 states and 801 transitions. [2025-02-06 18:04:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2025-02-06 18:04:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:48,964 INFO L225 Difference]: With dead ends: 584 [2025-02-06 18:04:48,964 INFO L226 Difference]: Without dead ends: 582 [2025-02-06 18:04:48,964 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-06 18:04:48,964 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:48,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1275 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-02-06 18:04:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-02-06 18:04:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 521 states have (on average 1.4702495201535508) internal successors, (766), 561 states have internal predecessors, (766), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 18:04:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 799 transitions. [2025-02-06 18:04:48,982 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 799 transitions. Word has length 64 [2025-02-06 18:04:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:48,983 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 799 transitions. [2025-02-06 18:04:48,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 799 transitions. [2025-02-06 18:04:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 18:04:48,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:48,983 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:48,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:04:48,984 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:48,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:48,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2128428982, now seen corresponding path program 2 times [2025-02-06 18:04:48,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:48,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116197197] [2025-02-06 18:04:48,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:49,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-06 18:04:49,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 65 statements. [2025-02-06 18:04:49,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:04:49,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-06 18:04:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116197197] [2025-02-06 18:04:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116197197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:04:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61324235] [2025-02-06 18:04:49,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:49,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:49,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:49,496 INFO L87 Difference]: Start difference. First operand 582 states and 799 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-06 18:04:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:49,627 INFO L93 Difference]: Finished difference Result 1077 states and 1493 transitions. [2025-02-06 18:04:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:49,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 65 [2025-02-06 18:04:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:49,631 INFO L225 Difference]: With dead ends: 1077 [2025-02-06 18:04:49,631 INFO L226 Difference]: Without dead ends: 586 [2025-02-06 18:04:49,633 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-06 18:04:49,633 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 27 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:49,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1241 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-06 18:04:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-02-06 18:04:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 524 states have (on average 1.465648854961832) internal successors, (768), 564 states have internal predecessors, (768), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 18:04:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 801 transitions. [2025-02-06 18:04:49,657 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 801 transitions. Word has length 65 [2025-02-06 18:04:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:49,658 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 801 transitions. [2025-02-06 18:04:49,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-06 18:04:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 801 transitions. [2025-02-06 18:04:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 18:04:49,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:49,659 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 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] [2025-02-06 18:04:49,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:04:49,659 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:49,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash -905942465, now seen corresponding path program 1 times [2025-02-06 18:04:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:49,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287078681] [2025-02-06 18:04:49,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:50,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 18:04:50,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 18:04:50,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:50,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-06 18:04:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287078681] [2025-02-06 18:04:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287078681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:50,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:04:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346965988] [2025-02-06 18:04:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:50,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:50,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:50,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:04:50,579 INFO L87 Difference]: Start difference. First operand 586 states and 801 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-06 18:04:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:50,817 INFO L93 Difference]: Finished difference Result 1092 states and 1515 transitions. [2025-02-06 18:04:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:04:50,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 73 [2025-02-06 18:04:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:50,820 INFO L225 Difference]: With dead ends: 1092 [2025-02-06 18:04:50,820 INFO L226 Difference]: Without dead ends: 588 [2025-02-06 18:04:50,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:04:50,825 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 0 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:50,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1903 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-02-06 18:04:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-02-06 18:04:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 526 states have (on average 1.4638783269961977) internal successors, (770), 566 states have internal predecessors, (770), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 18:04:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 803 transitions. [2025-02-06 18:04:50,847 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 803 transitions. Word has length 73 [2025-02-06 18:04:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:50,848 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 803 transitions. [2025-02-06 18:04:50,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-06 18:04:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 803 transitions. [2025-02-06 18:04:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 18:04:50,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:50,851 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 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] [2025-02-06 18:04:50,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:04:50,852 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:50,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash -212840768, now seen corresponding path program 1 times [2025-02-06 18:04:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:50,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345668964] [2025-02-06 18:04:50,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:51,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 18:04:51,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 18:04:51,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:51,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-06 18:04:51,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:51,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345668964] [2025-02-06 18:04:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345668964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:51,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:51,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:04:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357787706] [2025-02-06 18:04:51,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:51,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:04:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:04:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:51,512 INFO L87 Difference]: Start difference. First operand 588 states and 803 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06 18:04:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:51,756 INFO L93 Difference]: Finished difference Result 1097 states and 1522 transitions. [2025-02-06 18:04:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:04:51,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 73 [2025-02-06 18:04:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:51,760 INFO L225 Difference]: With dead ends: 1097 [2025-02-06 18:04:51,760 INFO L226 Difference]: Without dead ends: 591 [2025-02-06 18:04:51,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:51,762 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:51,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2532 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-06 18:04:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-02-06 18:04:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 529 states have (on average 1.4593572778827977) internal successors, (772), 569 states have internal predecessors, (772), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 18:04:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 805 transitions. [2025-02-06 18:04:51,783 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 805 transitions. Word has length 73 [2025-02-06 18:04:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:51,783 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 805 transitions. [2025-02-06 18:04:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06 18:04:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 805 transitions. [2025-02-06 18:04:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 18:04:51,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:51,784 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:51,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:04:51,784 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 71 more)] === [2025-02-06 18:04:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -672584752, now seen corresponding path program 2 times [2025-02-06 18:04:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507205319] [2025-02-06 18:04:51,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:52,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 18:04:52,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 18:04:52,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:52,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-06 18:04:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507205319] [2025-02-06 18:04:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507205319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655835990] [2025-02-06 18:04:52,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:52,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:52,553 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-06 18:04:52,556 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-06 18:04:53,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.