./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/sleep-4.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/sleep-4.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 f07d6115284d4b8fd87912ec19b91fd11dd42fe69a143470e194764137d2a5df --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:01:49,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:01:49,310 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:01:49,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:01:49,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:01:49,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:01:49,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:01:49,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:01:49,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:01:49,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:01:49,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:01:49,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:01:49,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:01:49,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:01:49,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:01:49,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:49,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:01:49,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:01:49,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:01:49,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:01:49,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:01:49,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:01:49,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:01:49,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:01:49,358 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 -> f07d6115284d4b8fd87912ec19b91fd11dd42fe69a143470e194764137d2a5df [2025-02-06 18:01:49,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:01:49,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:01:49,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:01:49,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:01:49,677 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:01:49,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/sleep-4.i [2025-02-06 18:01:51,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46e07f6b6/3631c3fc99434a48b2a4e432599efd40/FLAGc92b715c3 [2025-02-06 18:01:51,579 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:01:51,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-4.i [2025-02-06 18:01:51,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46e07f6b6/3631c3fc99434a48b2a4e432599efd40/FLAGc92b715c3 [2025-02-06 18:01:51,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46e07f6b6/3631c3fc99434a48b2a4e432599efd40 [2025-02-06 18:01:51,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:01:51,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:01:51,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:51,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:01:51,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:01:51,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:51,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5484e937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51, skipping insertion in model container [2025-02-06 18:01:51,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:51,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:01:52,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:52,560 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:01:52,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:52,852 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:01:52,860 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:01:52,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52 WrapperNode [2025-02-06 18:01:52,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:52,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:52,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:01:52,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:01:52,867 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:01:52" (1/1) ... [2025-02-06 18:01:52,924 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:01:52" (1/1) ... [2025-02-06 18:01:53,011 INFO L138 Inliner]: procedures = 633, calls = 577, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1054 [2025-02-06 18:01:53,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:53,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:01:53,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:01:53,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:01:53,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,077 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:01:53,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:01:53,167 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:01:53,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:01:53,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:01:53,169 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (1/1) ... [2025-02-06 18:01:53,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:53,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:53,201 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:01:53,205 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:01:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:01:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 18:01:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-02-06 18:01:53,227 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-02-06 18:01:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 18:01:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 18:01:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:01:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:01:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:01:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:01:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:01:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:01:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:01:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:01:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:01:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:01:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:01:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:01:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:01:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-06 18:01:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-06 18:01:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 18:01:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 18:01:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 18:01:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 18:01:53,596 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:01:53,598 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:01:58,410 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: call ULTIMATE.dealloc(__main_~#ts~0#1.base, __main_~#ts~0#1.offset);havoc __main_~#ts~0#1.base, __main_~#ts~0#1.offset; [2025-02-06 18:01:58,410 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2689: havoc nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1; [2025-02-06 18:01:58,657 INFO L? ?]: Removed 284 outVars from TransFormulas that were not future-live. [2025-02-06 18:01:58,659 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:01:58,685 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:01:58,688 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:01:58,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:58 BoogieIcfgContainer [2025-02-06 18:01:58,689 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:01:58,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:01:58,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:01:58,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:01:58,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:01:51" (1/3) ... [2025-02-06 18:01:58,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2804452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:58, skipping insertion in model container [2025-02-06 18:01:58,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:52" (2/3) ... [2025-02-06 18:01:58,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2804452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:58, skipping insertion in model container [2025-02-06 18:01:58,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:58" (3/3) ... [2025-02-06 18:01:58,702 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-4.i [2025-02-06 18:01:58,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:01:58,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-4.i that has 6 procedures, 213 locations, 1 initial locations, 14 loop locations, and 39 error locations. [2025-02-06 18:01:58,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:01:58,801 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;@29bc7a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:01:58,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-02-06 18:01:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 154 states have (on average 1.6233766233766234) internal successors, (250), 195 states have internal predecessors, (250), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 18:01:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:01:58,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:58,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:01:58,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:01:58,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:58,822 INFO L85 PathProgramCache]: Analyzing trace with hash 8310655, now seen corresponding path program 1 times [2025-02-06 18:01:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:58,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114313856] [2025-02-06 18:01:58,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:58,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:59,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:01:59,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:01:59,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:59,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:59,943 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:01:59,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:59,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114313856] [2025-02-06 18:01:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114313856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:59,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:59,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877451853] [2025-02-06 18:01:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:59,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:59,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:59,975 INFO L87 Difference]: Start difference. First operand has 213 states, 154 states have (on average 1.6233766233766234) internal successors, (250), 195 states have internal predecessors, (250), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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:02:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:00,053 INFO L93 Difference]: Finished difference Result 300 states and 401 transitions. [2025-02-06 18:02:00,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:00,056 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:02:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:00,064 INFO L225 Difference]: With dead ends: 300 [2025-02-06 18:02:00,064 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 18:02:00,070 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:02:00,076 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:00,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 208 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 18:02:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 18:02:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 81 states have internal predecessors, (99), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2025-02-06 18:02:00,124 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 4 [2025-02-06 18:02:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:00,124 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-02-06 18:02:00,124 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:02:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2025-02-06 18:02:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:02:00,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:00,125 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:02:00,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:02:00,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1525177365, now seen corresponding path program 1 times [2025-02-06 18:02:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351256432] [2025-02-06 18:02:00,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:00,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:02:00,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:02:00,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:00,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:00,769 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:02:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351256432] [2025-02-06 18:02:00,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351256432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:00,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392712461] [2025-02-06 18:02:00,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:00,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:00,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:00,774 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:02:00,775 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:02:01,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:02:01,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:02:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:01,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:01,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:02:01,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:01,485 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:02:01,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392712461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:01,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:02:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:02:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75186866] [2025-02-06 18:02:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:01,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:02:01,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:01,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:02:01,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:02:01,490 INFO L87 Difference]: Start difference. First operand 88 states and 107 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:02:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:01,558 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2025-02-06 18:02:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:02:01,560 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:02:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:01,561 INFO L225 Difference]: With dead ends: 88 [2025-02-06 18:02:01,561 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 18:02:01,561 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:02:01,562 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:01,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 292 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 18:02:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 18:02:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.462686567164179) internal successors, (98), 80 states have internal predecessors, (98), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-02-06 18:02:01,573 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 7 [2025-02-06 18:02:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:01,574 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-02-06 18:02:01,574 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:02:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-02-06 18:02:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:02:01,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:01,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:02:01,588 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:02:01,775 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:02:01,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:01,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash -35857855, now seen corresponding path program 1 times [2025-02-06 18:02:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353380417] [2025-02-06 18:02:01,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:02,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:02:02,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:02:02,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:02,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:02,244 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:02:02,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:02,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353380417] [2025-02-06 18:02:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353380417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:02,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:02,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:02:02,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339763654] [2025-02-06 18:02:02,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:02,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:02,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:02,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:02,245 INFO L87 Difference]: Start difference. First operand 87 states and 106 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:02:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:02,275 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2025-02-06 18:02:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:02,276 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:02:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:02,277 INFO L225 Difference]: With dead ends: 87 [2025-02-06 18:02:02,278 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 18:02:02,279 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:02:02,279 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:02,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 18:02:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-02-06 18:02:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 77 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2025-02-06 18:02:02,293 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 8 [2025-02-06 18:02:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:02,293 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2025-02-06 18:02:02,293 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:02:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2025-02-06 18:02:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 18:02:02,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:02,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:02,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:02:02,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:02,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:02,295 INFO L85 PathProgramCache]: Analyzing trace with hash 769580686, now seen corresponding path program 1 times [2025-02-06 18:02:02,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277942485] [2025-02-06 18:02:02,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:02,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:02:02,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:02:02,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:02,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:02,845 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:02:02,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277942485] [2025-02-06 18:02:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277942485] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847952376] [2025-02-06 18:02:02,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:02,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:02,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:02,849 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:02:02,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:02:03,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:02:03,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:02:03,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:03,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:03,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:02:03,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:03,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:02:03,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847952376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:03,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:02:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 18:02:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807433440] [2025-02-06 18:02:03,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:03,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:03,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:03,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:02:03,484 INFO L87 Difference]: Start difference. First operand 84 states and 103 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:02:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:03,527 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2025-02-06 18:02:03,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:03,531 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:02:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:03,532 INFO L225 Difference]: With dead ends: 84 [2025-02-06 18:02:03,532 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 18:02:03,533 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:02:03,533 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:03,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 150 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 18:02:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 18:02:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 75 states have internal predecessors, (93), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2025-02-06 18:02:03,547 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 12 [2025-02-06 18:02:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:03,548 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2025-02-06 18:02:03,548 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:02:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2025-02-06 18:02:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 18:02:03,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:03,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:03,561 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:02:03,749 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:02:03,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:03,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1912802312, now seen corresponding path program 1 times [2025-02-06 18:02:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:03,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002863480] [2025-02-06 18:02:03,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:03,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:03,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:02:04,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:02:04,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:04,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:04,199 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:02:04,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:04,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002863480] [2025-02-06 18:02:04,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002863480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:04,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504750012] [2025-02-06 18:02:04,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:04,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:04,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:04,203 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:02:04,204 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:02:04,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:02:04,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:02:04,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:04,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:04,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:02:04,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:04,828 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:02:04,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:02:04,880 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:02:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504750012] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:02:04,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:02:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:02:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018139226] [2025-02-06 18:02:04,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:02:04,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:02:04,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:04,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:02:04,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:02:04,882 INFO L87 Difference]: Start difference. First operand 82 states and 101 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:02:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:04,926 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2025-02-06 18:02:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:02:04,927 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:02:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:04,929 INFO L225 Difference]: With dead ends: 167 [2025-02-06 18:02:04,929 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 18:02:04,930 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:02:04,931 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:04,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 192 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 18:02:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 18:02:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 84 states have internal predecessors, (102), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2025-02-06 18:02:04,946 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 13 [2025-02-06 18:02:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:04,946 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2025-02-06 18:02:04,946 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:02:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2025-02-06 18:02:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:02:04,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:04,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:04,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:02:05,152 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:02:05,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:05,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1543622260, now seen corresponding path program 2 times [2025-02-06 18:02:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404507621] [2025-02-06 18:02:05,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:02:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:05,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 18:02:05,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 18:02:05,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:02:05,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:05,763 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:02:05,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:05,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404507621] [2025-02-06 18:02:05,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404507621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:05,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:05,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:02:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399300328] [2025-02-06 18:02:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:05,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:02:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:05,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:02:05,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:02:05,765 INFO L87 Difference]: Start difference. First operand 91 states and 110 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:02:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:05,835 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-02-06 18:02:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:02:05,837 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:02:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:05,838 INFO L225 Difference]: With dead ends: 91 [2025-02-06 18:02:05,838 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 18:02:05,838 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:02:05,839 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 34 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:05,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 322 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:02:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 18:02:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 18:02:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 82 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2025-02-06 18:02:05,846 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 22 [2025-02-06 18:02:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:05,846 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2025-02-06 18:02:05,846 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:02:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2025-02-06 18:02:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 18:02:05,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:05,847 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:02:05,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:02:05,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:05,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1035730795, now seen corresponding path program 1 times [2025-02-06 18:02:05,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:05,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118964489] [2025-02-06 18:02:05,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:06,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 18:02:06,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 18:02:06,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:06,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:06,349 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:02:06,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:06,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118964489] [2025-02-06 18:02:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118964489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:06,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:02:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17129819] [2025-02-06 18:02:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:06,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:06,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:06,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:06,352 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:06,383 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2025-02-06 18:02:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:06,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 18:02:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:06,385 INFO L225 Difference]: With dead ends: 157 [2025-02-06 18:02:06,385 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 18:02:06,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:06,386 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:06,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 18:02:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 18:02:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 85 states have internal predecessors, (103), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2025-02-06 18:02:06,395 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 27 [2025-02-06 18:02:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:06,395 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2025-02-06 18:02:06,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2025-02-06 18:02:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:02:06,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:06,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:06,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:02:06,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:06,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -406106171, now seen corresponding path program 1 times [2025-02-06 18:02:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414982749] [2025-02-06 18:02:06,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:06,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:02:06,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:02:06,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:06,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 18:02:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414982749] [2025-02-06 18:02:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414982749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:06,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:06,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:02:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960769697] [2025-02-06 18:02:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:06,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:06,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:06,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:06,886 INFO L87 Difference]: Start difference. First operand 92 states and 111 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:02:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:06,928 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2025-02-06 18:02:06,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:06,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-02-06 18:02:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:06,930 INFO L225 Difference]: With dead ends: 105 [2025-02-06 18:02:06,930 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 18:02:06,930 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:02:06,931 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 3 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:06,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 182 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 18:02:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-02-06 18:02:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 94 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2025-02-06 18:02:06,943 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 30 [2025-02-06 18:02:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2025-02-06 18:02:06,943 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:02:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2025-02-06 18:02:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:02:06,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:06,943 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:02:06,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:02:06,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:06,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -406106011, now seen corresponding path program 1 times [2025-02-06 18:02:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:06,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405712606] [2025-02-06 18:02:06,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:07,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:02:07,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:02:07,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:07,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:07,412 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:02:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:07,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405712606] [2025-02-06 18:02:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405712606] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:07,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59942545] [2025-02-06 18:02:07,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:07,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:07,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:07,417 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:02:07,420 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:02:07,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:02:08,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:02:08,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:08,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:08,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:02:08,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:08,202 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:02:08,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:02:08,351 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:02:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59942545] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:02:08,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:02:08,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:02:08,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318971300] [2025-02-06 18:02:08,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:02:08,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:02:08,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:08,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:02:08,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:02:08,353 INFO L87 Difference]: Start difference. First operand 101 states and 124 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:02:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:08,549 INFO L93 Difference]: Finished difference Result 204 states and 256 transitions. [2025-02-06 18:02:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:02:08,549 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:02:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:08,551 INFO L225 Difference]: With dead ends: 204 [2025-02-06 18:02:08,552 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 18:02:08,552 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:02:08,553 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:08,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 698 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:02:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 18:02:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 18:02:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.2692307692307692) internal successors, (132), 111 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2025-02-06 18:02:08,563 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 30 [2025-02-06 18:02:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:08,563 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2025-02-06 18:02:08,564 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:02:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2025-02-06 18:02:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:02:08,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:08,565 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:02:08,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 18:02:08,766 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:02:08,767 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:08,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1037819017, now seen corresponding path program 1 times [2025-02-06 18:02:08,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:08,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743740017] [2025-02-06 18:02:08,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:08,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:08,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:02:09,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:02:09,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:09,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:09,187 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:02:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:09,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743740017] [2025-02-06 18:02:09,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743740017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:09,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:09,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:02:09,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213534630] [2025-02-06 18:02:09,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:09,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:09,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:09,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:09,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:09,190 INFO L87 Difference]: Start difference. First operand 118 states and 140 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:02:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:09,214 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2025-02-06 18:02:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:09,218 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:02:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:09,219 INFO L225 Difference]: With dead ends: 118 [2025-02-06 18:02:09,219 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 18:02:09,219 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:02:09,220 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:09,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 18:02:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2025-02-06 18:02:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.26) internal successors, (126), 106 states have internal predecessors, (126), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2025-02-06 18:02:09,234 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 49 [2025-02-06 18:02:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:09,234 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2025-02-06 18:02:09,234 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:02:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2025-02-06 18:02:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 18:02:09,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:09,235 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:09,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:02:09,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting xatoul_sfxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:09,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1802078449, now seen corresponding path program 1 times [2025-02-06 18:02:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:09,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621337720] [2025-02-06 18:02:09,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:09,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 18:02:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 18:02:09,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:09,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:09,805 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:02:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621337720] [2025-02-06 18:02:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621337720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:09,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:09,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:02:09,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965899954] [2025-02-06 18:02:09,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:02:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:09,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:02:09,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:02:09,807 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:13,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 18:02:17,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 18:02:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:18,053 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2025-02-06 18:02:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:02:18,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-02-06 18:02:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:18,056 INFO L225 Difference]: With dead ends: 122 [2025-02-06 18:02:18,057 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 18:02:18,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:02:18,058 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:18,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 312 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-06 18:02:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 18:02:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2025-02-06 18:02:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 110 states have internal predecessors, (131), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2025-02-06 18:02:18,069 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 53 [2025-02-06 18:02:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:18,069 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2025-02-06 18:02:18,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2025-02-06 18:02:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 18:02:18,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:18,072 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:18,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:02:18,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting xatoul_sfxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:18,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:18,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1802108240, now seen corresponding path program 1 times [2025-02-06 18:02:18,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:18,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976934509] [2025-02-06 18:02:18,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:18,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 18:02:18,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 18:02:18,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:18,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:18,874 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:02:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976934509] [2025-02-06 18:02:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976934509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:18,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:18,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:02:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439719101] [2025-02-06 18:02:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:02:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:18,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:02:18,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:02:18,876 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:19,007 INFO L93 Difference]: Finished difference Result 176 states and 215 transitions. [2025-02-06 18:02:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:02:19,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-02-06 18:02:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:19,009 INFO L225 Difference]: With dead ends: 176 [2025-02-06 18:02:19,009 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 18:02:19,010 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:02:19,010 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 42 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 329 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:19,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 329 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:02:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 18:02:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-06 18:02:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.25) internal successors, (130), 110 states have internal predecessors, (130), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2025-02-06 18:02:19,016 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 53 [2025-02-06 18:02:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:19,016 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2025-02-06 18:02:19,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2025-02-06 18:02:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 18:02:19,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:19,017 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:02:19,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:02:19,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:19,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 122315469, now seen corresponding path program 1 times [2025-02-06 18:02:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345848168] [2025-02-06 18:02:19,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:19,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:02:19,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:02:19,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:19,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:19,455 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:02:19,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345848168] [2025-02-06 18:02:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345848168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774045451] [2025-02-06 18:02:19,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:19,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:19,458 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:02:19,460 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:02:19,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:02:20,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:02:20,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:20,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:20,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:02:20,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:20,197 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:02:20,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:02:20,219 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:02:20,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774045451] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:02:20,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:02:20,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:02:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150072005] [2025-02-06 18:02:20,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:02:20,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:02:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:20,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:02:20,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:02:20,221 INFO L87 Difference]: Start difference. First operand 117 states and 138 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:02:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:20,267 INFO L93 Difference]: Finished difference Result 205 states and 251 transitions. [2025-02-06 18:02:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:02:20,268 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:02:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:20,269 INFO L225 Difference]: With dead ends: 205 [2025-02-06 18:02:20,269 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 18:02:20,269 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:02:20,270 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:20,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 543 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 18:02:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 18:02:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 128 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2025-02-06 18:02:20,277 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 55 [2025-02-06 18:02:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:20,278 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2025-02-06 18:02:20,278 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:02:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2025-02-06 18:02:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 18:02:20,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:20,280 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:20,294 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:02:20,481 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,SelfDestructingSolverStorable12 [2025-02-06 18:02:20,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting xatoul_sfxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:20,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1264033128, now seen corresponding path program 1 times [2025-02-06 18:02:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390901873] [2025-02-06 18:02:20,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:20,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 18:02:20,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 18:02:20,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:20,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:02:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390901873] [2025-02-06 18:02:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390901873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212315617] [2025-02-06 18:02:20,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:20,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:20,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:20,997 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:02:20,999 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:02:21,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 18:02:21,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 18:02:21,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:21,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:21,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:02:21,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:02:21,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:02:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:02:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212315617] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:02:21,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:02:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 18:02:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768621243] [2025-02-06 18:02:21,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:02:21,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:02:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:21,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:02:21,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:02:21,883 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:22,002 INFO L93 Difference]: Finished difference Result 250 states and 302 transitions. [2025-02-06 18:02:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:02:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2025-02-06 18:02:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:22,004 INFO L225 Difference]: With dead ends: 250 [2025-02-06 18:02:22,004 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 18:02:22,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:02:22,005 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:22,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 183 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:02:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 18:02:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-02-06 18:02:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 158 states have (on average 1.1645569620253164) internal successors, (184), 164 states have internal predecessors, (184), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:02:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2025-02-06 18:02:22,013 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 69 [2025-02-06 18:02:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:22,013 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2025-02-06 18:02:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2025-02-06 18:02:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 18:02:22,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:22,015 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:22,029 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:02:22,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 18:02:22,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting xatoul_sfxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 36 more)] === [2025-02-06 18:02:22,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1625266328, now seen corresponding path program 2 times [2025-02-06 18:02:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:22,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750456651] [2025-02-06 18:02:22,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:02:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:22,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-06 18:02:23,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 18:02:23,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:02:23,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-06 18:02:28,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750456651] [2025-02-06 18:02:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750456651] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415431746] [2025-02-06 18:02:28,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:02:28,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:28,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:28,957 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:02:28,958 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:02:29,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-06 18:02:40,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 18:02:40,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:02:40,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:40,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1823 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-02-06 18:02:40,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:40,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:02:40,321 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 18:02:40,321 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:02:40,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 18:02:40,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 18:02:40,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:40,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 112 [2025-02-06 18:02:40,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:40,475 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2025-02-06 18:02:40,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 76 [2025-02-06 18:02:40,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:40,490 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 0 case distinctions, treesize of input 50 treesize of output 43 [2025-02-06 18:02:40,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:40,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:40,538 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 18:02:40,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-02-06 18:02:40,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:40,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 98 [2025-02-06 18:02:40,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:40,616 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-02-06 18:02:40,616 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 82 treesize of output 70 [2025-02-06 18:02:40,762 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:40,763 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 58 treesize of output 51 [2025-02-06 18:02:40,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:40,953 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:40,953 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 58 treesize of output 51 [2025-02-06 18:02:40,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:41,134 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:41,134 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 58 treesize of output 51 [2025-02-06 18:02:41,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:41,381 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:41,382 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 58 treesize of output 51 [2025-02-06 18:02:41,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:41,567 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:41,567 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 58 treesize of output 51 [2025-02-06 18:02:41,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:41,752 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:41,752 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 58 treesize of output 51 [2025-02-06 18:02:41,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:41,913 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:41,914 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 58 treesize of output 51 [2025-02-06 18:02:41,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:42,063 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:42,064 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 58 treesize of output 51 [2025-02-06 18:02:42,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:42,219 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:42,219 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 58 treesize of output 51 [2025-02-06 18:02:42,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:42,337 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:02:42,338 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 58 treesize of output 51 [2025-02-06 18:02:42,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-02-06 18:02:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-06 18:02:42,657 INFO L312 TraceCheckSpWp]: Computing backward predicates...