./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/who-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/who-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 4bd2645d5d5ea7178c11bbac573ddbc3f4d38de676a99814ea3062e83a1e36f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:04:19,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:04:19,721 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:19,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:04:19,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:04:19,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:04:19,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:04:19,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:04:19,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:04:19,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:04:19,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:04:19,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:04:19,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:04:19,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:04:19,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:04:19,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:04:19,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:04:19,755 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 -> 4bd2645d5d5ea7178c11bbac573ddbc3f4d38de676a99814ea3062e83a1e36f0 [2025-02-06 18:04:20,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:04:20,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:04:20,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:04:20,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:04:20,029 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:04:20,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/who-1.i [2025-02-06 18:04:21,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/665cacb40/e4edd1c355294a95a21052fc85e9468a/FLAG9c4b6e40f [2025-02-06 18:04:21,785 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:04:21,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/who-1.i [2025-02-06 18:04:21,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/665cacb40/e4edd1c355294a95a21052fc85e9468a/FLAG9c4b6e40f [2025-02-06 18:04:21,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/665cacb40/e4edd1c355294a95a21052fc85e9468a [2025-02-06 18:04:21,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:04:21,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:04:21,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:04:21,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:04:21,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:04:21,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:21,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf56c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:21, skipping insertion in model container [2025-02-06 18:04:21,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:04:21" (1/1) ... [2025-02-06 18:04:21,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:04:22,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:04:22,899 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:04:23,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:04:23,156 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:04:23,163 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:04:23,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:23 WrapperNode [2025-02-06 18:04:23,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:04:23,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:04:23,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:04:23,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:04:23,170 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:23" (1/1) ... [2025-02-06 18:04:23,221 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:23" (1/1) ... [2025-02-06 18:04:23,297 INFO L138 Inliner]: procedures = 639, calls = 723, calls flagged for inlining = 29, calls inlined = 28, statements flattened = 1979 [2025-02-06 18:04:23,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:04:23,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:04:23,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:04:23,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:04:23,306 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:23" (1/1) ... [2025-02-06 18:04:23,307 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:23" (1/1) ... [2025-02-06 18:04:23,327 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:23" (1/1) ... [2025-02-06 18:04:23,362 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:04:23,365 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:23" (1/1) ... [2025-02-06 18:04:23,365 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:23" (1/1) ... [2025-02-06 18:04:23,428 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:23" (1/1) ... [2025-02-06 18:04:23,433 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:23" (1/1) ... [2025-02-06 18:04:23,472 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:23" (1/1) ... [2025-02-06 18:04:23,478 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:23" (1/1) ... [2025-02-06 18:04:23,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:04:23,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:04:23,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:04:23,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:04:23,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:23" (1/1) ... [2025-02-06 18:04:23,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:04:23,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:23,543 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:23,551 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:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:04:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 18:04:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 18:04:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 18:04:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:04:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:04:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:04:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:04:23,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:04:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:04:23,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:04:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-06 18:04:23,575 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-06 18:04:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:04:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:04:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-06 18:04:23,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-06 18:04:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:04:23,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:04:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:04:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:04:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 18:04:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 18:04:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 18:04:23,577 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 18:04:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 18:04:23,920 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:04:23,922 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:04:25,930 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273: havoc getopt_long_#t~ret263#1; [2025-02-06 18:04:25,930 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2591: 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:26,123 INFO L? ?]: Removed 637 outVars from TransFormulas that were not future-live. [2025-02-06 18:04:26,123 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:04:26,182 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:04:26,182 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:04:26,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:04:26 BoogieIcfgContainer [2025-02-06 18:04:26,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:04:26,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:04:26,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:04:26,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:04:26,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:04:21" (1/3) ... [2025-02-06 18:04:26,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48229e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:04:26, skipping insertion in model container [2025-02-06 18:04:26,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:23" (2/3) ... [2025-02-06 18:04:26,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48229e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:04:26, skipping insertion in model container [2025-02-06 18:04:26,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:04:26" (3/3) ... [2025-02-06 18:04:26,200 INFO L128 eAbstractionObserver]: Analyzing ICFG who-1.i [2025-02-06 18:04:26,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:04:26,214 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG who-1.i that has 6 procedures, 530 locations, 1 initial locations, 33 loop locations, and 78 error locations. [2025-02-06 18:04:26,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:04:26,285 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;@230dcfcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:04:26,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2025-02-06 18:04:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 530 states, 426 states have (on average 1.676056338028169) internal successors, (714), 505 states have internal predecessors, (714), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:04:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:04:26,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:26,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:04:26,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:26,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 27643007, now seen corresponding path program 1 times [2025-02-06 18:04:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:26,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124323683] [2025-02-06 18:04:26,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:26,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:04:26,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:04:26,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:26,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:26,957 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:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:26,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124323683] [2025-02-06 18:04:26,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124323683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:26,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:26,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:26,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506529196] [2025-02-06 18:04:26,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:26,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:26,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:26,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:26,979 INFO L87 Difference]: Start difference. First operand has 530 states, 426 states have (on average 1.676056338028169) internal successors, (714), 505 states have internal predecessors, (714), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:27,130 INFO L93 Difference]: Finished difference Result 955 states and 1392 transitions. [2025-02-06 18:04:27,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:27,132 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:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:27,142 INFO L225 Difference]: With dead ends: 955 [2025-02-06 18:04:27,142 INFO L226 Difference]: Without dead ends: 426 [2025-02-06 18:04:27,148 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:27,153 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:27,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-06 18:04:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-02-06 18:04:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 357 states have (on average 1.588235294117647) internal successors, (567), 408 states have internal predecessors, (567), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 595 transitions. [2025-02-06 18:04:27,210 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 595 transitions. Word has length 4 [2025-02-06 18:04:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:27,211 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 595 transitions. [2025-02-06 18:04:27,211 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:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 595 transitions. [2025-02-06 18:04:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:04:27,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:27,211 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:04:27,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:04:27,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:27,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1120072993, now seen corresponding path program 1 times [2025-02-06 18:04:27,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:27,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127645575] [2025-02-06 18:04:27,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:27,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:04:27,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:04:27,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:27,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:27,586 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:27,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127645575] [2025-02-06 18:04:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127645575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253410201] [2025-02-06 18:04:27,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:27,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:27,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:27,590 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:27,592 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:27,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:04:28,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:04:28,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:28,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:28,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:28,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:28,085 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:28,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253410201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:28,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:04:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626672126] [2025-02-06 18:04:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:28,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:28,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:28,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:28,087 INFO L87 Difference]: Start difference. First operand 426 states and 595 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:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:28,176 INFO L93 Difference]: Finished difference Result 426 states and 595 transitions. [2025-02-06 18:04:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:04:28,179 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:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:28,181 INFO L225 Difference]: With dead ends: 426 [2025-02-06 18:04:28,181 INFO L226 Difference]: Without dead ends: 425 [2025-02-06 18:04:28,181 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:28,182 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1129 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:28,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1129 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:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-02-06 18:04:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-02-06 18:04:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 357 states have (on average 1.5854341736694677) internal successors, (566), 407 states have internal predecessors, (566), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 594 transitions. [2025-02-06 18:04:28,204 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 594 transitions. Word has length 7 [2025-02-06 18:04:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 594 transitions. [2025-02-06 18:04:28,205 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:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 594 transitions. [2025-02-06 18:04:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:04:28,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:28,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:04:28,216 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:28,406 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:28,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:28,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash -362523583, now seen corresponding path program 1 times [2025-02-06 18:04:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:28,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859254290] [2025-02-06 18:04:28,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:28,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:04:28,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:04:28,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:28,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:28,660 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:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:28,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859254290] [2025-02-06 18:04:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859254290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:28,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:28,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:28,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085871262] [2025-02-06 18:04:28,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:28,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:28,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:28,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:28,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:28,662 INFO L87 Difference]: Start difference. First operand 425 states and 594 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:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:28,715 INFO L93 Difference]: Finished difference Result 425 states and 594 transitions. [2025-02-06 18:04:28,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:28,716 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:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:28,717 INFO L225 Difference]: With dead ends: 425 [2025-02-06 18:04:28,717 INFO L226 Difference]: Without dead ends: 424 [2025-02-06 18:04:28,718 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:28,718 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 0 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:28,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1130 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-06 18:04:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2025-02-06 18:04:28,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 355 states have (on average 1.5859154929577466) internal successors, (563), 404 states have internal predecessors, (563), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 591 transitions. [2025-02-06 18:04:28,742 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 591 transitions. Word has length 8 [2025-02-06 18:04:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:28,743 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 591 transitions. [2025-02-06 18:04:28,743 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:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 591 transitions. [2025-02-06 18:04:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 18:04:28,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:28,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:28,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:04:28,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:28,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash -685793996, now seen corresponding path program 1 times [2025-02-06 18:04:28,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:28,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925377306] [2025-02-06 18:04:28,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:28,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:04:28,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:04:28,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:28,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:29,091 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:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:29,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925377306] [2025-02-06 18:04:29,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925377306] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:29,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555178] [2025-02-06 18:04:29,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:29,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:29,094 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:29,096 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:29,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:04:29,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:04:29,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:29,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:29,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:04:29,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:29,481 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:29,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:29,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:29,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 18:04:29,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138998615] [2025-02-06 18:04:29,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:29,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:29,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:29,484 INFO L87 Difference]: Start difference. First operand 422 states and 591 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:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:29,546 INFO L93 Difference]: Finished difference Result 422 states and 591 transitions. [2025-02-06 18:04:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:29,548 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:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:29,550 INFO L225 Difference]: With dead ends: 422 [2025-02-06 18:04:29,550 INFO L226 Difference]: Without dead ends: 420 [2025-02-06 18:04:29,550 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:29,551 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 526 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:29,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 604 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-06 18:04:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-02-06 18:04:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 355 states have (on average 1.580281690140845) internal successors, (561), 402 states have internal predecessors, (561), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 589 transitions. [2025-02-06 18:04:29,572 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 589 transitions. Word has length 12 [2025-02-06 18:04:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:29,573 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 589 transitions. [2025-02-06 18:04:29,573 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:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 589 transitions. [2025-02-06 18:04:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 18:04:29,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:29,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:29,586 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:29,778 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:29,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:29,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash 215223430, now seen corresponding path program 1 times [2025-02-06 18:04:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:29,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309644609] [2025-02-06 18:04:29,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:29,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:04:29,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:04:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:30,095 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:30,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309644609] [2025-02-06 18:04:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309644609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216680323] [2025-02-06 18:04:30,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:30,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:30,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:30,100 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:30,113 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:30,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:04:30,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:04:30,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:30,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:30,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:30,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:30,631 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:30,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:30,669 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:30,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216680323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:30,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:30,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:04:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074723055] [2025-02-06 18:04:30,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:30,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:30,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:30,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:30,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:30,673 INFO L87 Difference]: Start difference. First operand 420 states and 589 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:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:30,813 INFO L93 Difference]: Finished difference Result 843 states and 1183 transitions. [2025-02-06 18:04:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:30,814 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:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:30,816 INFO L225 Difference]: With dead ends: 843 [2025-02-06 18:04:30,816 INFO L226 Difference]: Without dead ends: 429 [2025-02-06 18:04:30,817 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:30,818 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 4 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:30,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2250 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-06 18:04:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-02-06 18:04:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 364 states have (on average 1.565934065934066) internal successors, (570), 411 states have internal predecessors, (570), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 598 transitions. [2025-02-06 18:04:30,835 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 598 transitions. Word has length 13 [2025-02-06 18:04:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:30,835 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 598 transitions. [2025-02-06 18:04:30,835 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:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 598 transitions. [2025-02-06 18:04:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:04:30,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:30,836 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:30,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:04:31,036 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:31,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1143874010, now seen corresponding path program 2 times [2025-02-06 18:04:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:31,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867231399] [2025-02-06 18:04:31,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:31,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 18:04:31,193 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:31,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:04:31,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:31,474 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:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867231399] [2025-02-06 18:04:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867231399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:31,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:04:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121013649] [2025-02-06 18:04:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:31,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:04:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:31,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:04:31,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:31,476 INFO L87 Difference]: Start difference. First operand 429 states and 598 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:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:31,602 INFO L93 Difference]: Finished difference Result 429 states and 598 transitions. [2025-02-06 18:04:31,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:04:31,602 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:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:31,605 INFO L225 Difference]: With dead ends: 429 [2025-02-06 18:04:31,605 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 18:04:31,605 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:31,606 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 525 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:31,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1693 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 18:04:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-02-06 18:04:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 364 states have (on average 1.5604395604395604) internal successors, (568), 409 states have internal predecessors, (568), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 596 transitions. [2025-02-06 18:04:31,621 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 596 transitions. Word has length 22 [2025-02-06 18:04:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:31,621 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 596 transitions. [2025-02-06 18:04:31,621 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:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 596 transitions. [2025-02-06 18:04:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 18:04:31,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:31,622 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:31,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:04:31,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:31,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1113508431, now seen corresponding path program 1 times [2025-02-06 18:04:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260699240] [2025-02-06 18:04:31,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:31,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 18:04:31,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 18:04:31,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:31,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:31,959 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:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260699240] [2025-02-06 18:04:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260699240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:31,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:31,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894108740] [2025-02-06 18:04:31,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:31,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:31,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:31,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:31,963 INFO L87 Difference]: Start difference. First operand 427 states and 596 transitions. Second operand has 3 states, 2 states have (on average 8.0) 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:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:32,026 INFO L93 Difference]: Finished difference Result 837 states and 1176 transitions. [2025-02-06 18:04:32,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:32,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) 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:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:32,028 INFO L225 Difference]: With dead ends: 837 [2025-02-06 18:04:32,028 INFO L226 Difference]: Without dead ends: 430 [2025-02-06 18:04:32,029 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,029 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:32,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1119 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-06 18:04:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-02-06 18:04:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 367 states have (on average 1.555858310626703) internal successors, (571), 412 states have internal predecessors, (571), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 599 transitions. [2025-02-06 18:04:32,051 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 599 transitions. Word has length 27 [2025-02-06 18:04:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:32,052 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 599 transitions. [2025-02-06 18:04:32,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) 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:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 599 transitions. [2025-02-06 18:04:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 18:04:32,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:32,053 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:32,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:04:32,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash 158684192, now seen corresponding path program 1 times [2025-02-06 18:04:32,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:32,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146064088] [2025-02-06 18:04:32,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:32,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:32,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 18:04:32,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 18:04:32,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:32,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:32,327 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:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146064088] [2025-02-06 18:04:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146064088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:32,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:32,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879411319] [2025-02-06 18:04:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:32,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:32,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:32,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:32,329 INFO L87 Difference]: Start difference. First operand 430 states and 599 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:32,423 INFO L93 Difference]: Finished difference Result 729 states and 1038 transitions. [2025-02-06 18:04:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 28 [2025-02-06 18:04:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:32,428 INFO L225 Difference]: With dead ends: 729 [2025-02-06 18:04:32,428 INFO L226 Difference]: Without dead ends: 727 [2025-02-06 18:04:32,428 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,429 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 413 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:32,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1106 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-06 18:04:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 434. [2025-02-06 18:04:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 371 states have (on average 1.5525606469002695) internal successors, (576), 416 states have internal predecessors, (576), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 604 transitions. [2025-02-06 18:04:32,446 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 604 transitions. Word has length 28 [2025-02-06 18:04:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:32,447 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 604 transitions. [2025-02-06 18:04:32,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 604 transitions. [2025-02-06 18:04:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:04:32,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:32,447 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:32,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:04:32,448 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:32,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1796915969, now seen corresponding path program 1 times [2025-02-06 18:04:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822800431] [2025-02-06 18:04:32,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:32,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:04:32,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:04:32,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:32,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:32,763 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:32,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:32,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822800431] [2025-02-06 18:04:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822800431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:32,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295154771] [2025-02-06 18:04:32,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:32,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:32,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:32,769 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:32,779 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:33,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:04:33,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:04:33,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:33,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:33,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:04:33,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:33,407 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:33,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:33,496 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:33,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295154771] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:33,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:33,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:04:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044241311] [2025-02-06 18:04:33,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:33,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:04:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:33,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:04:33,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:04:33,498 INFO L87 Difference]: Start difference. First operand 434 states and 604 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:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:33,701 INFO L93 Difference]: Finished difference Result 870 states and 1216 transitions. [2025-02-06 18:04:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:04:33,702 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:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:33,704 INFO L225 Difference]: With dead ends: 870 [2025-02-06 18:04:33,705 INFO L226 Difference]: Without dead ends: 451 [2025-02-06 18:04:33,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:04:33,706 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 5 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2772 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:33,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2772 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-06 18:04:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2025-02-06 18:04:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 389 states have (on average 1.5244215938303343) internal successors, (593), 433 states have internal predecessors, (593), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 621 transitions. [2025-02-06 18:04:33,721 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 621 transitions. Word has length 30 [2025-02-06 18:04:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:33,722 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 621 transitions. [2025-02-06 18:04:33,722 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:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 621 transitions. [2025-02-06 18:04:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 18:04:33,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:33,723 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:33,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:04:33,923 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,SelfDestructingSolverStorable8 [2025-02-06 18:04:33,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:33,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -765073313, now seen corresponding path program 1 times [2025-02-06 18:04:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071523272] [2025-02-06 18:04:33,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:34,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 18:04:34,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 18:04:34,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:34,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:04:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071523272] [2025-02-06 18:04:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071523272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:34,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382199575] [2025-02-06 18:04:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:34,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:34,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:34,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:34,190 INFO L87 Difference]: Start difference. First operand 451 states and 621 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:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:34,257 INFO L93 Difference]: Finished difference Result 463 states and 635 transitions. [2025-02-06 18:04:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:34,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 18:04:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:34,260 INFO L225 Difference]: With dead ends: 463 [2025-02-06 18:04:34,261 INFO L226 Difference]: Without dead ends: 461 [2025-02-06 18:04:34,261 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:34,262 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 2 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1114 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:34,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1114 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:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-02-06 18:04:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2025-02-06 18:04:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 398 states have (on average 1.520100502512563) internal successors, (605), 442 states have internal predecessors, (605), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 633 transitions. [2025-02-06 18:04:34,277 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 633 transitions. Word has length 48 [2025-02-06 18:04:34,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:34,277 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 633 transitions. [2025-02-06 18:04:34,277 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:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 633 transitions. [2025-02-06 18:04:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:04:34,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:34,280 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:34,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:04:34,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:34,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2052536849, now seen corresponding path program 1 times [2025-02-06 18:04:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984241879] [2025-02-06 18:04:34,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:34,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:04:34,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:04:34,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:34,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:34,484 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:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:34,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984241879] [2025-02-06 18:04:34,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984241879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:34,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:34,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:34,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951111739] [2025-02-06 18:04:34,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:34,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:34,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:34,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:34,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:34,485 INFO L87 Difference]: Start difference. First operand 460 states and 633 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:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:34,535 INFO L93 Difference]: Finished difference Result 460 states and 633 transitions. [2025-02-06 18:04:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:34,535 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:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:34,538 INFO L225 Difference]: With dead ends: 460 [2025-02-06 18:04:34,538 INFO L226 Difference]: Without dead ends: 459 [2025-02-06 18:04:34,538 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:34,539 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 0 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:34,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1117 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-06 18:04:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2025-02-06 18:04:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 394 states have (on average 1.5203045685279188) internal successors, (599), 437 states have internal predecessors, (599), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 627 transitions. [2025-02-06 18:04:34,556 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 627 transitions. Word has length 49 [2025-02-06 18:04:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:34,557 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 627 transitions. [2025-02-06 18:04:34,557 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:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 627 transitions. [2025-02-06 18:04:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 18:04:34,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:34,559 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] [2025-02-06 18:04:34,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:04:34,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:34,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash -907231324, now seen corresponding path program 1 times [2025-02-06 18:04:34,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:34,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248346192] [2025-02-06 18:04:34,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:34,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:34,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:04:34,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:04:34,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:34,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:34,828 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:34,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:34,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248346192] [2025-02-06 18:04:34,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248346192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:34,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333759398] [2025-02-06 18:04:34,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:34,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:34,831 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:34,833 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:35,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:04:35,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:04:35,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:35,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:35,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:35,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:35,303 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:35,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333759398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:35,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:04:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115713427] [2025-02-06 18:04:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:35,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:35,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:35,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:35,304 INFO L87 Difference]: Start difference. First operand 455 states and 627 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:35,434 INFO L93 Difference]: Finished difference Result 752 states and 1064 transitions. [2025-02-06 18:04:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:04:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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 50 [2025-02-06 18:04:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:35,437 INFO L225 Difference]: With dead ends: 752 [2025-02-06 18:04:35,438 INFO L226 Difference]: Without dead ends: 751 [2025-02-06 18:04:35,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:35,439 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 825 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:35,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1675 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-02-06 18:04:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 454. [2025-02-06 18:04:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 394 states have (on average 1.517766497461929) internal successors, (598), 436 states have internal predecessors, (598), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 626 transitions. [2025-02-06 18:04:35,456 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 626 transitions. Word has length 50 [2025-02-06 18:04:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:35,457 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 626 transitions. [2025-02-06 18:04:35,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 626 transitions. [2025-02-06 18:04:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 18:04:35,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:35,459 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] [2025-02-06 18:04:35,469 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:35,660 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:35,661 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1940600830, now seen corresponding path program 1 times [2025-02-06 18:04:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853108482] [2025-02-06 18:04:35,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:35,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:04:35,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:04:35,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:35,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:35,966 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:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853108482] [2025-02-06 18:04:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853108482] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323913892] [2025-02-06 18:04:35,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:35,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:35,969 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:35,985 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:36,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:04:36,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:04:36,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:36,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:36,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:36,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:36,622 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:36,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:36,649 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:36,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323913892] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:36,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:36,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 18:04:36,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002264751] [2025-02-06 18:04:36,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:36,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:36,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:36,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:36,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:36,651 INFO L87 Difference]: Start difference. First operand 454 states and 626 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:36,924 INFO L93 Difference]: Finished difference Result 1639 states and 2372 transitions. [2025-02-06 18:04:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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 51 [2025-02-06 18:04:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:36,931 INFO L225 Difference]: With dead ends: 1639 [2025-02-06 18:04:36,931 INFO L226 Difference]: Without dead ends: 1638 [2025-02-06 18:04:36,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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,933 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2950 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2978 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:36,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2978 Valid, 2637 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-02-06 18:04:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 466. [2025-02-06 18:04:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 406 states have (on average 1.5098522167487685) internal successors, (613), 448 states have internal predecessors, (613), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 641 transitions. [2025-02-06 18:04:36,957 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 641 transitions. Word has length 51 [2025-02-06 18:04:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:36,957 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 641 transitions. [2025-02-06 18:04:36,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 641 transitions. [2025-02-06 18:04:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 18:04:36,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:36,958 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:36,970 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:37,158 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:37,160 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:37,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2083563879, now seen corresponding path program 1 times [2025-02-06 18:04:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419183571] [2025-02-06 18:04:37,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:37,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:04:37,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:04:37,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:37,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:37,454 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:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419183571] [2025-02-06 18:04:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419183571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:37,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742947014] [2025-02-06 18:04:37,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:37,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:37,458 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:37,459 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:37,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:04:37,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:04:37,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:37,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:38,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:38,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:38,017 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:38,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:38,039 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:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742947014] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:38,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:04:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961440528] [2025-02-06 18:04:38,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:38,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:38,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:38,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:38,041 INFO L87 Difference]: Start difference. First operand 466 states and 641 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:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:38,114 INFO L93 Difference]: Finished difference Result 907 states and 1259 transitions. [2025-02-06 18:04:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:38,114 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:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:38,116 INFO L225 Difference]: With dead ends: 907 [2025-02-06 18:04:38,117 INFO L226 Difference]: Without dead ends: 484 [2025-02-06 18:04:38,118 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:38,120 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 4 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:38,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1115 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-02-06 18:04:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-02-06 18:04:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 424 states have (on average 1.4882075471698113) internal successors, (631), 466 states have internal predecessors, (631), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 659 transitions. [2025-02-06 18:04:38,139 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 659 transitions. Word has length 55 [2025-02-06 18:04:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:38,139 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 659 transitions. [2025-02-06 18:04:38,139 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:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 659 transitions. [2025-02-06 18:04:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 18:04:38,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:38,141 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] [2025-02-06 18:04:38,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 18:04:38,341 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:38,342 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:38,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1069730997, now seen corresponding path program 1 times [2025-02-06 18:04:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142531655] [2025-02-06 18:04:38,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:38,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 18:04:38,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 18:04:38,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:38,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:38,592 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:38,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:38,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142531655] [2025-02-06 18:04:38,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142531655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:38,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:38,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377446918] [2025-02-06 18:04:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:38,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:38,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:38,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:38,594 INFO L87 Difference]: Start difference. First operand 484 states and 659 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:38,720 INFO L93 Difference]: Finished difference Result 964 states and 1345 transitions. [2025-02-06 18:04:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:38,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 60 [2025-02-06 18:04:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:38,723 INFO L225 Difference]: With dead ends: 964 [2025-02-06 18:04:38,723 INFO L226 Difference]: Without dead ends: 580 [2025-02-06 18:04:38,724 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,725 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 120 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:38,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1064 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-06 18:04:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 526. [2025-02-06 18:04:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 465 states have (on average 1.4774193548387098) internal successors, (687), 507 states have internal predecessors, (687), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 717 transitions. [2025-02-06 18:04:38,744 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 717 transitions. Word has length 60 [2025-02-06 18:04:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:38,744 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 717 transitions. [2025-02-06 18:04:38,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 717 transitions. [2025-02-06 18:04:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 18:04:38,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:38,745 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:38,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:04:38,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1514279479, now seen corresponding path program 1 times [2025-02-06 18:04:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968957530] [2025-02-06 18:04:38,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:38,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:38,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 18:04:38,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 18:04:38,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:38,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:38,980 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:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968957530] [2025-02-06 18:04:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968957530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:38,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:38,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910162753] [2025-02-06 18:04:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:38,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:38,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:38,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:38,982 INFO L87 Difference]: Start difference. First operand 526 states and 717 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:39,033 INFO L93 Difference]: Finished difference Result 528 states and 717 transitions. [2025-02-06 18:04:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:39,033 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), 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 62 [2025-02-06 18:04:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:39,035 INFO L225 Difference]: With dead ends: 528 [2025-02-06 18:04:39,035 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 18:04:39,036 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:39,036 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:39,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 18:04:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-06 18:04:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 465 states have (on average 1.4731182795698925) internal successors, (685), 507 states have internal predecessors, (685), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 715 transitions. [2025-02-06 18:04:39,055 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 715 transitions. Word has length 62 [2025-02-06 18:04:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:39,055 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 715 transitions. [2025-02-06 18:04:39,055 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), 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:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 715 transitions. [2025-02-06 18:04:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 18:04:39,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:39,056 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] [2025-02-06 18:04:39,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:04:39,056 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -762931470, now seen corresponding path program 2 times [2025-02-06 18:04:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067878549] [2025-02-06 18:04:39,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:39,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-06 18:04:39,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-02-06 18:04:39,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:04:39,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:39,418 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:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067878549] [2025-02-06 18:04:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067878549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:39,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:39,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:04:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846902933] [2025-02-06 18:04:39,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:39,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:04:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:39,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:04:39,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:04:39,421 INFO L87 Difference]: Start difference. First operand 526 states and 715 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:39,564 INFO L93 Difference]: Finished difference Result 980 states and 1352 transitions. [2025-02-06 18:04:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:39,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 63 [2025-02-06 18:04:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:39,567 INFO L225 Difference]: With dead ends: 980 [2025-02-06 18:04:39,567 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 18:04:39,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:04:39,568 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 526 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:39,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 2210 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 18:04:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-06 18:04:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 465 states have (on average 1.4709677419354839) internal successors, (684), 507 states have internal predecessors, (684), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 714 transitions. [2025-02-06 18:04:39,583 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 714 transitions. Word has length 63 [2025-02-06 18:04:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:39,583 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 714 transitions. [2025-02-06 18:04:39,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 714 transitions. [2025-02-06 18:04:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 18:04:39,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:39,585 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:39,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:04:39,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:39,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:39,586 INFO L85 PathProgramCache]: Analyzing trace with hash -700538121, now seen corresponding path program 2 times [2025-02-06 18:04:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:39,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857821339] [2025-02-06 18:04:39,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:39,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 18:04:39,765 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:39,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:39,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:39,949 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:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857821339] [2025-02-06 18:04:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857821339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248846780] [2025-02-06 18:04:39,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:39,952 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:39,953 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:40,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 18:04:43,492 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:43,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:43,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:43,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:04:43,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 18:04:43,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 18:04:43,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248846780] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:43,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:43,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:04:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541982931] [2025-02-06 18:04:43,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:43,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:04:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:43,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:04:43,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:04:43,631 INFO L87 Difference]: Start difference. First operand 526 states and 714 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:44,093 INFO L93 Difference]: Finished difference Result 1035 states and 1421 transitions. [2025-02-06 18:04:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 18:04:44,093 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:44,097 INFO L225 Difference]: With dead ends: 1035 [2025-02-06 18:04:44,098 INFO L226 Difference]: Without dead ends: 561 [2025-02-06 18:04:44,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 18:04:44,100 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 9 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3860 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:44,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3860 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-06 18:04:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-02-06 18:04:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 501 states have (on average 1.435129740518962) internal successors, (719), 542 states have internal predecessors, (719), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 749 transitions. [2025-02-06 18:04:44,124 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 749 transitions. Word has length 73 [2025-02-06 18:04:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:44,125 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 749 transitions. [2025-02-06 18:04:44,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 749 transitions. [2025-02-06 18:04:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 18:04:44,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:44,127 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-02-06 18:04:44,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 18:04:44,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 18:04:44,329 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:44,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash -852309958, now seen corresponding path program 1 times [2025-02-06 18:04:44,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:44,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497030876] [2025-02-06 18:04:44,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:44,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:44,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:04:44,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:04:44,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497030876] [2025-02-06 18:04:44,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497030876] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502562147] [2025-02-06 18:04:44,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:44,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:44,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:44,837 INFO L229 MonitoredProcess]: Starting monitored process 10 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,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 18:04:45,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:04:45,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:04:45,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:45,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:45,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:04:45,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:45,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502562147] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:45,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:45,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 18:04:45,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372072392] [2025-02-06 18:04:45,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:45,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:04:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:45,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:04:45,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:04:45,724 INFO L87 Difference]: Start difference. First operand 561 states and 749 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:46,369 INFO L93 Difference]: Finished difference Result 3936 states and 5665 transitions. [2025-02-06 18:04:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:04:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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 97 [2025-02-06 18:04:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:46,389 INFO L225 Difference]: With dead ends: 3936 [2025-02-06 18:04:46,389 INFO L226 Difference]: Without dead ends: 3935 [2025-02-06 18:04:46,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:04:46,391 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 6612 mSDsluCounter, 5729 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6682 SdHoareTripleChecker+Valid, 6282 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:46,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6682 Valid, 6282 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 18:04:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2025-02-06 18:04:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 585. [2025-02-06 18:04:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 525 states have (on average 1.4266666666666667) internal successors, (749), 566 states have internal predecessors, (749), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 779 transitions. [2025-02-06 18:04:46,444 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 779 transitions. Word has length 97 [2025-02-06 18:04:46,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:46,444 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 779 transitions. [2025-02-06 18:04:46,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 779 transitions. [2025-02-06 18:04:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:04:46,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:46,446 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:46,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 18:04:46,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:46,647 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:46,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1177077703, now seen corresponding path program 1 times [2025-02-06 18:04:46,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:46,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388894108] [2025-02-06 18:04:46,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:46,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:46,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:04:46,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:04:46,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:46,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388894108] [2025-02-06 18:04:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388894108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:46,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387559206] [2025-02-06 18:04:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:46,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:46,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:46,938 INFO L87 Difference]: Start difference. First operand 585 states and 779 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:47,089 INFO L93 Difference]: Finished difference Result 966 states and 1336 transitions. [2025-02-06 18:04:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 103 [2025-02-06 18:04:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:47,092 INFO L225 Difference]: With dead ends: 966 [2025-02-06 18:04:47,092 INFO L226 Difference]: Without dead ends: 638 [2025-02-06 18:04:47,093 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:47,094 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 75 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:47,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1119 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-06 18:04:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 588. [2025-02-06 18:04:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 530 states have (on average 1.420754716981132) internal successors, (753), 569 states have internal predecessors, (753), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 783 transitions. [2025-02-06 18:04:47,116 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 783 transitions. Word has length 103 [2025-02-06 18:04:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:47,116 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 783 transitions. [2025-02-06 18:04:47,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 783 transitions. [2025-02-06 18:04:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:04:47,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:47,117 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:47,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:04:47,118 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:47,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:47,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1181354378, now seen corresponding path program 1 times [2025-02-06 18:04:47,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:47,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994508621] [2025-02-06 18:04:47,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:47,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:04:47,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:04:47,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:47,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994508621] [2025-02-06 18:04:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994508621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:47,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:47,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:47,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748900841] [2025-02-06 18:04:47,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:47,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:47,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:47,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:47,534 INFO L87 Difference]: Start difference. First operand 588 states and 783 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:47,651 INFO L93 Difference]: Finished difference Result 642 states and 862 transitions. [2025-02-06 18:04:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 103 [2025-02-06 18:04:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:47,654 INFO L225 Difference]: With dead ends: 642 [2025-02-06 18:04:47,654 INFO L226 Difference]: Without dead ends: 639 [2025-02-06 18:04:47,655 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:47,655 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 190 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:47,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 911 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-06 18:04:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 585. [2025-02-06 18:04:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 530 states have (on average 1.4150943396226414) internal successors, (750), 566 states have internal predecessors, (750), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 780 transitions. [2025-02-06 18:04:47,677 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 780 transitions. Word has length 103 [2025-02-06 18:04:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:47,677 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 780 transitions. [2025-02-06 18:04:47,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 780 transitions. [2025-02-06 18:04:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:04:47,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:47,678 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:47,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:04:47,678 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:47,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2129670964, now seen corresponding path program 1 times [2025-02-06 18:04:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145464561] [2025-02-06 18:04:47,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:47,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:04:47,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:04:47,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:47,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:47,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145464561] [2025-02-06 18:04:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145464561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:47,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066413992] [2025-02-06 18:04:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:47,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:47,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:47,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:47,959 INFO L87 Difference]: Start difference. First operand 585 states and 780 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:48,086 INFO L93 Difference]: Finished difference Result 968 states and 1338 transitions. [2025-02-06 18:04:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:48,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 104 [2025-02-06 18:04:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:48,089 INFO L225 Difference]: With dead ends: 968 [2025-02-06 18:04:48,089 INFO L226 Difference]: Without dead ends: 636 [2025-02-06 18:04:48,090 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,092 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 157 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:48,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 987 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-02-06 18:04:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 570. [2025-02-06 18:04:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 519 states have (on average 1.4065510597302504) internal successors, (730), 551 states have internal predecessors, (730), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 760 transitions. [2025-02-06 18:04:48,114 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 760 transitions. Word has length 104 [2025-02-06 18:04:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:48,114 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 760 transitions. [2025-02-06 18:04:48,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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,115 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 760 transitions. [2025-02-06 18:04:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:04:48,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:48,116 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:48,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 18:04:48,116 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:48,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2032719368, now seen corresponding path program 1 times [2025-02-06 18:04:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799949298] [2025-02-06 18:04:48,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:48,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:04:48,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:04:48,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:48,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:48,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799949298] [2025-02-06 18:04:48,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799949298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:48,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:48,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395870334] [2025-02-06 18:04:48,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:48,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:48,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:48,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:48,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:48,435 INFO L87 Difference]: Start difference. First operand 570 states and 760 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:48,559 INFO L93 Difference]: Finished difference Result 624 states and 839 transitions. [2025-02-06 18:04:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:48,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 104 [2025-02-06 18:04:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:48,563 INFO L225 Difference]: With dead ends: 624 [2025-02-06 18:04:48,564 INFO L226 Difference]: Without dead ends: 623 [2025-02-06 18:04:48,564 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,565 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 187 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:48,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 986 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-02-06 18:04:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 569. [2025-02-06 18:04:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 519 states have (on average 1.4046242774566473) internal successors, (729), 550 states have internal predecessors, (729), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 759 transitions. [2025-02-06 18:04:48,586 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 759 transitions. Word has length 104 [2025-02-06 18:04:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:48,586 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 759 transitions. [2025-02-06 18:04:48,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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,586 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 759 transitions. [2025-02-06 18:04:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 18:04:48,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:48,588 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:48,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:04:48,588 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:48,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash -325277900, now seen corresponding path program 1 times [2025-02-06 18:04:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879776559] [2025-02-06 18:04:48,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:04:48,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:04:48,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:48,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:48,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879776559] [2025-02-06 18:04:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879776559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433173031] [2025-02-06 18:04:48,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:48,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:48,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:48,960 INFO L229 MonitoredProcess]: Starting monitored process 11 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:48,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 18:04:49,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:04:49,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:04:49,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:49,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:49,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:04:49,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:49,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433173031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 18:04:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083732306] [2025-02-06 18:04:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:49,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:04:49,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:49,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:04:49,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:04:49,811 INFO L87 Difference]: Start difference. First operand 569 states and 759 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:49,977 INFO L93 Difference]: Finished difference Result 1068 states and 1474 transitions. [2025-02-06 18:04:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:04:49,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 105 [2025-02-06 18:04:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:49,981 INFO L225 Difference]: With dead ends: 1068 [2025-02-06 18:04:49,981 INFO L226 Difference]: Without dead ends: 686 [2025-02-06 18:04:49,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:04:49,983 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 350 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:49,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1400 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-06 18:04:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 568. [2025-02-06 18:04:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 520 states have (on average 1.396153846153846) internal successors, (726), 549 states have internal predecessors, (726), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 756 transitions. [2025-02-06 18:04:50,014 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 756 transitions. Word has length 105 [2025-02-06 18:04:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:50,015 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 756 transitions. [2025-02-06 18:04:50,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 756 transitions. [2025-02-06 18:04:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 18:04:50,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:50,017 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:50,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 18:04:50,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 18:04:50,220 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:50,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -906919969, now seen corresponding path program 1 times [2025-02-06 18:04:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432375486] [2025-02-06 18:04:50,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:50,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 18:04:50,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 18:04:50,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:50,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-02-06 18:04:50,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432375486] [2025-02-06 18:04:50,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432375486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:50,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:50,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:50,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833573204] [2025-02-06 18:04:50,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:50,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:50,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:50,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:50,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:50,505 INFO L87 Difference]: Start difference. First operand 568 states and 756 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:50,569 INFO L93 Difference]: Finished difference Result 568 states and 756 transitions. [2025-02-06 18:04:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:50,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 108 [2025-02-06 18:04:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:50,572 INFO L225 Difference]: With dead ends: 568 [2025-02-06 18:04:50,572 INFO L226 Difference]: Without dead ends: 567 [2025-02-06 18:04:50,573 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:50,573 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 1 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:50,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1089 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-06 18:04:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-06 18:04:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 520 states have (on average 1.3942307692307692) internal successors, (725), 548 states have internal predecessors, (725), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 755 transitions. [2025-02-06 18:04:50,598 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 755 transitions. Word has length 108 [2025-02-06 18:04:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:50,600 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 755 transitions. [2025-02-06 18:04:50,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 755 transitions. [2025-02-06 18:04:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 18:04:50,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:50,602 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:50,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 18:04:50,603 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:50,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1950252807, now seen corresponding path program 1 times [2025-02-06 18:04:50,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:50,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842056327] [2025-02-06 18:04:50,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:50,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 18:04:50,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 18:04:50,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:50,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:51,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:51,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842056327] [2025-02-06 18:04:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842056327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:51,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:04:51,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980323579] [2025-02-06 18:04:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:51,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:51,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:51,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:04:51,391 INFO L87 Difference]: Start difference. First operand 567 states and 755 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:51,530 INFO L93 Difference]: Finished difference Result 986 states and 1349 transitions. [2025-02-06 18:04:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:04:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-02-06 18:04:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:51,540 INFO L225 Difference]: With dead ends: 986 [2025-02-06 18:04:51,541 INFO L226 Difference]: Without dead ends: 573 [2025-02-06 18:04:51,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:51,544 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 4 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:51,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1629 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-06 18:04:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 572. [2025-02-06 18:04:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 524 states have (on average 1.3950381679389312) internal successors, (731), 552 states have internal predecessors, (731), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 18:04:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 762 transitions. [2025-02-06 18:04:51,570 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 762 transitions. Word has length 109 [2025-02-06 18:04:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:51,570 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 762 transitions. [2025-02-06 18:04:51,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 762 transitions. [2025-02-06 18:04:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 18:04:51,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:51,591 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:51,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 18:04:51,592 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash 477756490, now seen corresponding path program 1 times [2025-02-06 18:04:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170301488] [2025-02-06 18:04:51,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:51,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:04:51,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:04:51,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:51,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170301488] [2025-02-06 18:04:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170301488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121923048] [2025-02-06 18:04:52,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:52,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:52,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:52,357 INFO L229 MonitoredProcess]: Starting monitored process 12 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,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 18:04:53,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:04:53,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:04:53,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:53,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:53,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:04:53,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:53,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:53,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121923048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:53,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:53,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 18:04:53,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497350208] [2025-02-06 18:04:53,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:53,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:04:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:53,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:04:53,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:04:53,457 INFO L87 Difference]: Start difference. First operand 572 states and 762 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:04:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:53,683 INFO L93 Difference]: Finished difference Result 1003 states and 1375 transitions. [2025-02-06 18:04:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:04:53,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 110 [2025-02-06 18:04:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:53,686 INFO L225 Difference]: With dead ends: 1003 [2025-02-06 18:04:53,686 INFO L226 Difference]: Without dead ends: 585 [2025-02-06 18:04:53,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:04:53,687 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 4 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:53,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2179 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-06 18:04:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 580. [2025-02-06 18:04:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 530 states have (on average 1.3981132075471698) internal successors, (741), 560 states have internal predecessors, (741), 17 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 18:04:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 775 transitions. [2025-02-06 18:04:53,714 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 775 transitions. Word has length 110 [2025-02-06 18:04:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:53,714 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 775 transitions. [2025-02-06 18:04:53,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:04:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 775 transitions. [2025-02-06 18:04:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 18:04:53,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:53,716 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:53,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 18:04:53,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 18:04:53,917 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:53,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:53,918 INFO L85 PathProgramCache]: Analyzing trace with hash 737654036, now seen corresponding path program 1 times [2025-02-06 18:04:53,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:53,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483220817] [2025-02-06 18:04:53,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:54,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:04:54,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:04:54,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:54,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 18:04:54,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:54,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483220817] [2025-02-06 18:04:54,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483220817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:54,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891480725] [2025-02-06 18:04:54,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:54,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:54,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:54,272 INFO L229 MonitoredProcess]: Starting monitored process 13 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:54,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 18:04:54,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:04:55,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:04:55,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:55,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:55,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:55,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 18:04:55,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 18:04:55,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891480725] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:55,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:55,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 18:04:55,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524358166] [2025-02-06 18:04:55,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:55,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:55,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:55,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:55,344 INFO L87 Difference]: Start difference. First operand 580 states and 775 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:55,530 INFO L93 Difference]: Finished difference Result 683 states and 886 transitions. [2025-02-06 18:04:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:55,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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 110 [2025-02-06 18:04:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:55,533 INFO L225 Difference]: With dead ends: 683 [2025-02-06 18:04:55,533 INFO L226 Difference]: Without dead ends: 682 [2025-02-06 18:04:55,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 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:55,535 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:55,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3243 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-06 18:04:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-02-06 18:04:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 632 states have (on average 1.3433544303797469) internal successors, (849), 662 states have internal predecessors, (849), 17 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 18:04:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 883 transitions. [2025-02-06 18:04:55,560 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 883 transitions. Word has length 110 [2025-02-06 18:04:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:55,561 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 883 transitions. [2025-02-06 18:04:55,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 883 transitions. [2025-02-06 18:04:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 18:04:55,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:55,563 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:55,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 18:04:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 18:04:55,764 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-06 18:04:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1708472263, now seen corresponding path program 2 times [2025-02-06 18:04:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241954220] [2025-02-06 18:04:55,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:55,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-02-06 18:04:55,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 18:04:55,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:55,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241954220] [2025-02-06 18:04:56,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241954220] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879090921] [2025-02-06 18:04:56,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:56,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:56,580 INFO L229 MonitoredProcess]: Starting monitored process 14 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:56,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 18:04:57,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-02-06 18:04:59,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 18:04:59,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:59,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:59,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-06 18:04:59,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:59,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,270 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 18:04:59,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 18:04:59,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,685 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 18:04:59,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 18:04:59,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:59,753 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-06 18:04:59,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-06 18:04:59,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 132 [2025-02-06 18:04:59,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-02-06 18:04:59,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,847 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-02-06 18:04:59,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2025-02-06 18:04:59,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 26 [2025-02-06 18:04:59,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 144 [2025-02-06 18:04:59,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,876 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-02-06 18:04:59,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 89 [2025-02-06 18:04:59,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-02-06 18:04:59,898 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-02-06 18:04:59,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-02-06 18:04:59,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-02-06 18:04:59,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 106 [2025-02-06 18:04:59,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,946 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-02-06 18:04:59,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 78 [2025-02-06 18:04:59,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 100 [2025-02-06 18:04:59,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:59,974 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-02-06 18:04:59,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2025-02-06 18:05:00,009 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,050 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,099 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,140 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,192 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,240 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,288 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,372 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,430 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:05:00,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:05:00,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:05:00,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-02-06 18:05:00,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:05:00,690 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset_#t~loopctr286_15| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_15| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_15| 1) |c_#Ultimate.C_memset_#t~loopctr286|) (<= 1 |v_#Ultimate.C_memset_#t~loopctr286_15|))) is different from true [2025-02-06 18:05:00,712 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset_#t~loopctr286_15| Int) (|v_#Ultimate.C_memset_#t~loopctr286_16| Int)) (and (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_16| 1) |c_#Ultimate.C_memset_#t~loopctr286|) (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_15| 1) |v_#Ultimate.C_memset_#t~loopctr286_16|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_15| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_16| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memset_#t~loopctr286_15|))) is different from true [2025-02-06 18:05:00,734 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset_#t~loopctr286_17| Int) (|v_#Ultimate.C_memset_#t~loopctr286_15| Int) (|#Ultimate.C_memset_#ptr.base| Int) (|v_#Ultimate.C_memset_#t~loopctr286_16| Int)) (and (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_15| 1) |v_#Ultimate.C_memset_#t~loopctr286_16|) (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_16| 1) |v_#Ultimate.C_memset_#t~loopctr286_17|) (<= 1 |v_#Ultimate.C_memset_#t~loopctr286_15|) (= (store |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_15| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_16| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_17| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|)) |c_#memory_int|))) is different from true [2025-02-06 18:05:00,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:05:00,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:05:00,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:05:00,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:05:00,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:05:00,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:05:00,793 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 18:05:00,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 43 [2025-02-06 18:05:01,244 INFO L349 Elim1Store]: treesize reduction 72, result has 74.7 percent of original size [2025-02-06 18:05:01,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 272 [2025-02-06 18:05:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 241 trivial. 9 not checked. [2025-02-06 18:05:06,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:05:36,339 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9150 (Array Int Int))) (not (= 33 (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store |c_#memory_int| .cse0 v_ArrVal_9148) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_9150))) 11) 0)))) is different from false [2025-02-06 18:05:36,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9146 (Array Int Int)) (v_ArrVal_9147 (Array Int Int)) (v_ArrVal_9150 (Array Int Int)) (v_ArrVal_9144 (Array Int Int)) (v_ArrVal_9145 (Array Int Int)) (v_ArrVal_9142 (Array Int Int)) (v_ArrVal_9143 (Array Int Int))) (not (= 33 (select (select (let ((.cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9143))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9144))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_9147))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9142) .cse1 v_ArrVal_9145) .cse2 v_ArrVal_9146) .cse3 v_ArrVal_9148) (select (select (store .cse4 .cse3 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_9150))))))))) 11) 0)))) is different from false [2025-02-06 18:05:37,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9140 (Array Int Int)) (v_ArrVal_9141 (Array Int Int)) (v_ArrVal_9150 (Array Int Int)) (v_ArrVal_9144 (Array Int Int)) (v_ArrVal_9145 (Array Int Int)) (v_ArrVal_9142 (Array Int Int)) (v_ArrVal_9143 (Array Int Int)) (v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9138 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9146 (Array Int Int)) (v_ArrVal_9147 (Array Int Int)) (v_ArrVal_9139 (Array Int Int))) (not (= (select (select (let ((.cse7 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9138))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_9140))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_9143))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_9144))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_9147))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9139) .cse1 v_ArrVal_9141) .cse2 v_ArrVal_9142) .cse3 v_ArrVal_9145) .cse4 v_ArrVal_9146) .cse5 v_ArrVal_9148) (select (select (store .cse6 .cse5 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_9150))))))))))))) 11) 0) 33))) is different from false [2025-02-06 18:05:37,402 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9140 (Array Int Int)) (v_ArrVal_9141 (Array Int Int)) (v_ArrVal_9150 (Array Int Int)) (v_ArrVal_9144 (Array Int Int)) (v_ArrVal_9145 (Array Int Int)) (v_ArrVal_9142 (Array Int Int)) (v_ArrVal_9143 (Array Int Int)) (v_ArrVal_9137 (Array Int Int)) (v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9138 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9146 (Array Int Int)) (v_ArrVal_9136 (Array Int Int)) (v_ArrVal_9147 (Array Int Int)) (v_ArrVal_9139 (Array Int Int))) (not (= 33 (select (select (let ((.cse8 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9137))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_9138))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_9140))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_9143))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_9144))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_9147))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9136) .cse1 v_ArrVal_9139) .cse2 v_ArrVal_9141) .cse3 v_ArrVal_9142) .cse4 v_ArrVal_9145) .cse5 v_ArrVal_9146) .cse6 v_ArrVal_9148) (select (select (store .cse7 .cse6 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_9150))))))))))))))) 11) 0)))) is different from false