./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 551b0097 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-?-551b009-m [2025-01-10 06:04:59,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:04:59,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:05:00,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:05:00,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:05:00,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:05:00,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:05:00,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:05:00,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:05:00,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:05:00,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:05:00,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:05:00,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:05:00,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:05:00,032 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:05:00,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:05:00,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:05:00,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:05:00,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:05:00,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:05:00,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:05:00,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:05:00,033 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:05:00,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:05:00,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:05:00,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:05:00,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:05:00,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:05:00,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:05:00,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:05:00,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:05:00,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:05:00,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:05:00,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:05:00,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:05:00,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:05:00,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:05:00,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:05:00,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:05:00,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:05:00,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:05:00,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:05:00,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:05:00,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:05:00,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:05:00,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:05:00,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:05:00,036 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-01-10 06:05:00,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:05:00,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:05:00,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:05:00,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:05:00,424 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:05:00,427 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-01-10 06:05:02,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f739804aa/329f244268dc412ba8da22584a267b21/FLAGec22553d7 [2025-01-10 06:05:02,449 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:05:02,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-4.i [2025-01-10 06:05:02,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f739804aa/329f244268dc412ba8da22584a267b21/FLAGec22553d7 [2025-01-10 06:05:02,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f739804aa/329f244268dc412ba8da22584a267b21 [2025-01-10 06:05:02,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:05:02,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:05:02,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:05:02,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:05:02,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:05:02,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:05:02" (1/1) ... [2025-01-10 06:05:02,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f113f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:02, skipping insertion in model container [2025-01-10 06:05:02,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:05:02" (1/1) ... [2025-01-10 06:05:02,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:05:03,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:05:03,618 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:05:03,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:05:03,934 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:05:03,942 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:05:03,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03 WrapperNode [2025-01-10 06:05:03,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:05:03,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:05:03,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:05:03,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:05:03,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:03,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,066 INFO L138 Inliner]: procedures = 633, calls = 577, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1054 [2025-01-10 06:05:04,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:05:04,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:05:04,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:05:04,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:05:04,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,114 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:05:04,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,164 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:05:04,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:05:04,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:05:04,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:05:04,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (1/1) ... [2025-01-10 06:05:04,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:05:04,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:04,260 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-01-10 06:05:04,264 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-01-10 06:05:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:05:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:05:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-01-10 06:05:04,297 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-01-10 06:05:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:05:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:05:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:05:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:05:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:05:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:05:04,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:05:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:05:04,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:05:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:05:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:05:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:05:04,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:05:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:05:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:05:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-01-10 06:05:04,301 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-01-10 06:05:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:05:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 06:05:04,301 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 06:05:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:05:04,738 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:05:04,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:05:09,897 INFO L? ?]: Removed 284 outVars from TransFormulas that were not future-live. [2025-01-10 06:05:09,898 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:05:09,915 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:05:09,917 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-10 06:05:09,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:05:09 BoogieIcfgContainer [2025-01-10 06:05:09,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:05:09,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:05:09,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:05:09,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:05:09,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:05:02" (1/3) ... [2025-01-10 06:05:09,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ac147b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:05:09, skipping insertion in model container [2025-01-10 06:05:09,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:03" (2/3) ... [2025-01-10 06:05:09,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ac147b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:05:09, skipping insertion in model container [2025-01-10 06:05:09,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:05:09" (3/3) ... [2025-01-10 06:05:09,928 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-4.i [2025-01-10 06:05:09,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:05:09,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-4.i that has 6 procedures, 210 locations, 1 initial locations, 14 loop locations, and 39 error locations. [2025-01-10 06:05:10,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:05:10,021 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;@40df9d23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:05:10,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-10 06:05:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 151 states have (on average 1.6357615894039734) internal successors, (247), 192 states have internal predecessors, (247), 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-01-10 06:05:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:05:10,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:10,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:05:10,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:10,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash 7821252, now seen corresponding path program 1 times [2025-01-10 06:05:10,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:10,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058892898] [2025-01-10 06:05:10,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:10,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:05:10,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:05:10,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:10,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:05:11,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058892898] [2025-01-10 06:05:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058892898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:11,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:11,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:05:11,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699334773] [2025-01-10 06:05:11,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:11,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:11,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:11,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:11,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:11,175 INFO L87 Difference]: Start difference. First operand has 210 states, 151 states have (on average 1.6357615894039734) internal successors, (247), 192 states have internal predecessors, (247), 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-01-10 06:05:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:11,258 INFO L93 Difference]: Finished difference Result 296 states and 397 transitions. [2025-01-10 06:05:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:11,261 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-01-10 06:05:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:11,270 INFO L225 Difference]: With dead ends: 296 [2025-01-10 06:05:11,271 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 06:05:11,278 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-01-10 06:05:11,281 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 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-01-10 06:05:11,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 06:05:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-10 06:05:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4848484848484849) 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-01-10 06:05:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-01-10 06:05:11,333 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 4 [2025-01-10 06:05:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:11,334 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-01-10 06:05:11,335 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-01-10 06:05:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-01-10 06:05:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:05:11,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:11,335 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:05:11,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:05:11,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:11,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1074946374, now seen corresponding path program 1 times [2025-01-10 06:05:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:11,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820492623] [2025-01-10 06:05:11,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:11,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:05:11,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:05:11,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:11,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:05:11,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:11,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820492623] [2025-01-10 06:05:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820492623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:11,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511213805] [2025-01-10 06:05:11,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:11,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:11,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:11,937 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-01-10 06:05:11,938 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-01-10 06:05:12,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:05:12,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:05:12,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:12,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:12,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:05:12,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:05:12,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:05:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511213805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:12,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:05:12,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:05:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774727373] [2025-01-10 06:05:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:12,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:05:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:12,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:05:12,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:05:12,599 INFO L87 Difference]: Start difference. First operand 87 states and 106 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-01-10 06:05:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:12,663 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2025-01-10 06:05:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:05:12,664 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-01-10 06:05:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:12,665 INFO L225 Difference]: With dead ends: 87 [2025-01-10 06:05:12,666 INFO L226 Difference]: Without dead ends: 86 [2025-01-10 06:05:12,667 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-01-10 06:05:12,667 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 289 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-01-10 06:05:12,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 289 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-10 06:05:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-10 06:05:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 79 states have internal predecessors, (97), 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-01-10 06:05:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2025-01-10 06:05:12,684 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 7 [2025-01-10 06:05:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:12,684 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2025-01-10 06:05:12,684 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-01-10 06:05:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2025-01-10 06:05:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:05:12,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:12,685 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:05:12,698 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-01-10 06:05:12,886 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-01-10 06:05:12,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:12,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1036400510, now seen corresponding path program 1 times [2025-01-10 06:05:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:12,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878857929] [2025-01-10 06:05:12,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:13,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:05:13,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:05:13,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:13,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:05:13,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878857929] [2025-01-10 06:05:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878857929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:05:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577037315] [2025-01-10 06:05:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:13,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:13,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:13,371 INFO L87 Difference]: Start difference. First operand 86 states and 105 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-01-10 06:05:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:13,395 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2025-01-10 06:05:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:13,399 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-01-10 06:05:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:13,400 INFO L225 Difference]: With dead ends: 86 [2025-01-10 06:05:13,400 INFO L226 Difference]: Without dead ends: 85 [2025-01-10 06:05:13,400 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-01-10 06:05:13,401 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 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-01-10 06:05:13,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-10 06:05:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2025-01-10 06:05:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.46875) internal successors, (94), 76 states have internal predecessors, (94), 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-01-10 06:05:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2025-01-10 06:05:13,412 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 8 [2025-01-10 06:05:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:13,412 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2025-01-10 06:05:13,413 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-01-10 06:05:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2025-01-10 06:05:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:05:13,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:13,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:13,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:05:13,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:13,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:13,414 INFO L85 PathProgramCache]: Analyzing trace with hash 355117966, now seen corresponding path program 1 times [2025-01-10 06:05:13,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:13,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761411086] [2025-01-10 06:05:13,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:13,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:05:13,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:05:13,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:13,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:05:13,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:13,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761411086] [2025-01-10 06:05:13,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761411086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:13,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195330480] [2025-01-10 06:05:13,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:13,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:13,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:13,939 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-01-10 06:05:13,941 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-01-10 06:05:14,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:05:14,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:05:14,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:14,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:14,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:05:14,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:05:14,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:05:14,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195330480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:14,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:05:14,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:05:14,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371001817] [2025-01-10 06:05:14,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:14,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:14,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:14,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:05:14,516 INFO L87 Difference]: Start difference. First operand 83 states and 102 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-01-10 06:05:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:14,560 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2025-01-10 06:05:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:14,561 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-01-10 06:05:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:14,562 INFO L225 Difference]: With dead ends: 83 [2025-01-10 06:05:14,562 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 06:05:14,563 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-01-10 06:05:14,563 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 148 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-01-10 06:05:14,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 148 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 06:05:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-10 06:05:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.4375) internal successors, (92), 74 states have internal predecessors, (92), 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-01-10 06:05:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2025-01-10 06:05:14,578 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 12 [2025-01-10 06:05:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:14,580 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2025-01-10 06:05:14,580 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-01-10 06:05:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2025-01-10 06:05:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:05:14,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:14,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:14,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:05:14,781 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-01-10 06:05:14,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:14,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1876244671, now seen corresponding path program 1 times [2025-01-10 06:05:14,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:14,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456237426] [2025-01-10 06:05:14,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:14,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:14,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:05:15,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:05:15,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:15,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:05:15,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:15,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456237426] [2025-01-10 06:05:15,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456237426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:15,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494173918] [2025-01-10 06:05:15,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:15,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:15,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:15,238 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-01-10 06:05:15,240 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-01-10 06:05:15,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:05:15,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:05:15,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:15,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:15,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:05:15,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:05:15,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:05:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:05:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494173918] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:05:15,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:05:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:05:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99966042] [2025-01-10 06:05:15,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:05:15,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:05:15,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:15,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:05:15,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:05:15,904 INFO L87 Difference]: Start difference. First operand 81 states and 100 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-01-10 06:05:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:15,951 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2025-01-10 06:05:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:05:15,953 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-01-10 06:05:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:15,954 INFO L225 Difference]: With dead ends: 165 [2025-01-10 06:05:15,954 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 06:05:15,955 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-01-10 06:05:15,955 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:15,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 06:05:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-10 06:05:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 83 states have internal predecessors, (101), 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-01-10 06:05:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2025-01-10 06:05:15,964 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 13 [2025-01-10 06:05:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:15,964 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2025-01-10 06:05:15,964 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-01-10 06:05:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2025-01-10 06:05:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:05:15,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:15,965 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:15,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:05:16,166 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-01-10 06:05:16,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1644648257, now seen corresponding path program 2 times [2025-01-10 06:05:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337570152] [2025-01-10 06:05:16,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:05:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:16,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:05:16,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:05:16,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:05:16,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:05:16,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:16,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337570152] [2025-01-10 06:05:16,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337570152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:16,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:05:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649025201] [2025-01-10 06:05:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:16,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:05:16,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:16,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:05:16,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:05:16,692 INFO L87 Difference]: Start difference. First operand 90 states and 109 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-01-10 06:05:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:16,748 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2025-01-10 06:05:16,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:05:16,752 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-01-10 06:05:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:16,753 INFO L225 Difference]: With dead ends: 90 [2025-01-10 06:05:16,753 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 06:05:16,754 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-01-10 06:05:16,754 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 34 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:16,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 318 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 06:05:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-10 06:05:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.356164383561644) 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-01-10 06:05:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2025-01-10 06:05:16,764 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 22 [2025-01-10 06:05:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:16,764 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-01-10 06:05:16,764 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-01-10 06:05:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2025-01-10 06:05:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:05:16,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:16,765 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:16,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:05:16,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:16,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:16,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1621509304, now seen corresponding path program 1 times [2025-01-10 06:05:16,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:16,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872029518] [2025-01-10 06:05:16,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:16,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:16,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:05:16,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:05:16,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:16,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:05:17,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:17,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872029518] [2025-01-10 06:05:17,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872029518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:17,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:17,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:05:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735676204] [2025-01-10 06:05:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:17,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:17,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:17,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:17,182 INFO L87 Difference]: Start difference. First operand 88 states and 107 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-01-10 06:05:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:17,212 INFO L93 Difference]: Finished difference Result 155 states and 195 transitions. [2025-01-10 06:05:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:17,217 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-01-10 06:05:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:17,218 INFO L225 Difference]: With dead ends: 155 [2025-01-10 06:05:17,218 INFO L226 Difference]: Without dead ends: 91 [2025-01-10 06:05:17,219 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-01-10 06:05:17,219 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 183 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-01-10 06:05:17,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 183 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-10 06:05:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-10 06:05:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.3421052631578947) 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-01-10 06:05:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2025-01-10 06:05:17,232 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 27 [2025-01-10 06:05:17,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:17,232 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2025-01-10 06:05:17,232 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-01-10 06:05:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2025-01-10 06:05:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:05:17,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:17,233 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-01-10 06:05:17,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:05:17,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:17,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 881062537, now seen corresponding path program 1 times [2025-01-10 06:05:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206158499] [2025-01-10 06:05:17,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:17,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:05:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:05:17,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:17,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 06:05:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:17,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206158499] [2025-01-10 06:05:17,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206158499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:17,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:17,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:05:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27003744] [2025-01-10 06:05:17,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:17,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:17,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:17,640 INFO L87 Difference]: Start difference. First operand 91 states and 110 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-01-10 06:05:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:17,681 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2025-01-10 06:05:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:17,682 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-01-10 06:05:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:17,683 INFO L225 Difference]: With dead ends: 104 [2025-01-10 06:05:17,683 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 06:05:17,684 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-01-10 06:05:17,685 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 180 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-01-10 06:05:17,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 180 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 06:05:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-01-10 06:05:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 93 states have internal predecessors, (115), 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-01-10 06:05:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2025-01-10 06:05:17,695 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 30 [2025-01-10 06:05:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:17,695 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2025-01-10 06:05:17,696 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-01-10 06:05:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2025-01-10 06:05:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:05:17,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:17,697 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-01-10 06:05:17,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:05:17,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:17,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 881062345, now seen corresponding path program 1 times [2025-01-10 06:05:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929394524] [2025-01-10 06:05:17,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:17,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:05:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:05:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:05:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:18,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929394524] [2025-01-10 06:05:18,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929394524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:18,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042800609] [2025-01-10 06:05:18,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:18,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:18,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:18,153 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-01-10 06:05:18,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:05:18,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:05:18,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:05:18,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:18,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:18,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:05:18,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:05:18,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:05:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:05:19,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042800609] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:05:19,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:05:19,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:05:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266354331] [2025-01-10 06:05:19,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:05:19,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:05:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:19,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:05:19,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:05:19,018 INFO L87 Difference]: Start difference. First operand 100 states and 123 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-01-10 06:05:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:19,184 INFO L93 Difference]: Finished difference Result 202 states and 254 transitions. [2025-01-10 06:05:19,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:05:19,184 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-01-10 06:05:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:19,185 INFO L225 Difference]: With dead ends: 202 [2025-01-10 06:05:19,185 INFO L226 Difference]: Without dead ends: 117 [2025-01-10 06:05:19,186 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-01-10 06:05:19,186 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 5 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:19,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 604 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:05:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-10 06:05:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-10 06:05:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.2718446601941749) 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-01-10 06:05:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2025-01-10 06:05:19,201 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2025-01-10 06:05:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:19,201 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2025-01-10 06:05:19,201 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-01-10 06:05:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2025-01-10 06:05:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:05:19,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:19,207 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-01-10 06:05:19,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:05:19,408 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-01-10 06:05:19,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1656563254, now seen corresponding path program 1 times [2025-01-10 06:05:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87745917] [2025-01-10 06:05:19,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:19,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:05:19,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:05:19,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:19,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:05:19,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:19,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87745917] [2025-01-10 06:05:19,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87745917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:19,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:19,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:05:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742487155] [2025-01-10 06:05:19,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:19,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:19,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:19,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:19,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:19,907 INFO L87 Difference]: Start difference. First operand 117 states and 139 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-01-10 06:05:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:19,930 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2025-01-10 06:05:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:19,932 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-01-10 06:05:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:19,933 INFO L225 Difference]: With dead ends: 117 [2025-01-10 06:05:19,933 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 06:05:19,933 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-01-10 06:05:19,934 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 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-01-10 06:05:19,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 06:05:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2025-01-10 06:05:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 105 states have internal predecessors, (125), 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-01-10 06:05:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2025-01-10 06:05:19,943 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 49 [2025-01-10 06:05:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:19,944 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2025-01-10 06:05:19,944 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-01-10 06:05:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2025-01-10 06:05:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 06:05:19,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:19,945 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-01-10 06:05:19,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:05:19,945 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting xatoul_sfxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1547729369, now seen corresponding path program 1 times [2025-01-10 06:05:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:19,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642090338] [2025-01-10 06:05:19,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:20,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 06:05:20,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 06:05:20,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:20,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:05:20,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:20,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642090338] [2025-01-10 06:05:20,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642090338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:20,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:20,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:05:20,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316952640] [2025-01-10 06:05:20,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:20,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:05:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:20,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:05:20,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:05:20,467 INFO L87 Difference]: Start difference. First operand 112 states and 133 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-01-10 06:05:24,491 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-01-10 06:05:28,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 06:05:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:28,651 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2025-01-10 06:05:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:05:28,651 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-01-10 06:05:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:28,652 INFO L225 Difference]: With dead ends: 121 [2025-01-10 06:05:28,652 INFO L226 Difference]: Without dead ends: 119 [2025-01-10 06:05:28,653 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-01-10 06:05:28,653 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 308 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-01-10 06:05:28,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 308 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-01-10 06:05:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-10 06:05:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2025-01-10 06:05:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 109 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-01-10 06:05:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2025-01-10 06:05:28,663 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 53 [2025-01-10 06:05:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:28,664 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2025-01-10 06:05:28,664 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-01-10 06:05:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2025-01-10 06:05:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 06:05:28,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:28,667 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-01-10 06:05:28,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:05:28,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting xatoul_sfxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1547788951, now seen corresponding path program 1 times [2025-01-10 06:05:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055321235] [2025-01-10 06:05:28,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:28,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 06:05:29,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 06:05:29,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:29,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:05:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055321235] [2025-01-10 06:05:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055321235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:05:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875562964] [2025-01-10 06:05:29,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:29,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:05:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:29,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:05:29,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:05:29,379 INFO L87 Difference]: Start difference. First operand 116 states and 138 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-01-10 06:05:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:29,469 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2025-01-10 06:05:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:05:29,469 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-01-10 06:05:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:29,471 INFO L225 Difference]: With dead ends: 174 [2025-01-10 06:05:29,471 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 06:05:29,471 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-01-10 06:05:29,471 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 36 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:29,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 381 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:05:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 06:05:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-10 06:05:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 109 states have internal predecessors, (129), 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-01-10 06:05:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2025-01-10 06:05:29,477 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 53 [2025-01-10 06:05:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:29,477 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2025-01-10 06:05:29,478 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-01-10 06:05:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2025-01-10 06:05:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:05:29,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:29,478 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-01-10 06:05:29,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:05:29,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:29,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash 147990692, now seen corresponding path program 1 times [2025-01-10 06:05:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437382211] [2025-01-10 06:05:29,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:29,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:05:29,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:05:29,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:29,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:05:29,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:29,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437382211] [2025-01-10 06:05:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437382211] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:29,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908083555] [2025-01-10 06:05:29,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:29,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:29,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:29,872 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-01-10 06:05:29,875 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-01-10 06:05:30,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:05:30,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:05:30,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:30,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:30,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:05:30,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:05:30,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:05:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:05:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908083555] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:05:30,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:05:30,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:05:30,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929156759] [2025-01-10 06:05:30,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:05:30,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:05:30,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:30,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:05:30,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:05:30,683 INFO L87 Difference]: Start difference. First operand 116 states and 137 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-01-10 06:05:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:30,722 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2025-01-10 06:05:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:05:30,722 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-01-10 06:05:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:30,723 INFO L225 Difference]: With dead ends: 203 [2025-01-10 06:05:30,723 INFO L226 Difference]: Without dead ends: 134 [2025-01-10 06:05:30,724 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-01-10 06:05:30,724 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:30,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 270 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:05:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-10 06:05:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-01-10 06:05:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 127 states have internal predecessors, (147), 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-01-10 06:05:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2025-01-10 06:05:30,731 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 55 [2025-01-10 06:05:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:30,732 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2025-01-10 06:05:30,732 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-01-10 06:05:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2025-01-10 06:05:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 06:05:30,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:30,733 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-01-10 06:05:30,747 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-01-10 06:05:30,936 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-01-10 06:05:30,937 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting xatoul_sfxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:30,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 606346123, now seen corresponding path program 1 times [2025-01-10 06:05:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689409416] [2025-01-10 06:05:30,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:31,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 06:05:31,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 06:05:31,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:31,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:05:31,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:31,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689409416] [2025-01-10 06:05:31,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689409416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:31,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020683166] [2025-01-10 06:05:31,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:31,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:31,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:31,492 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-01-10 06:05:31,495 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-01-10 06:05:32,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 06:05:32,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 06:05:32,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:32,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:32,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:05:32,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:05:32,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:05:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:05:32,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020683166] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:05:32,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:05:32,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 06:05:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656863470] [2025-01-10 06:05:32,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:05:32,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:05:32,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:05:32,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:05:32,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:05:32,409 INFO L87 Difference]: Start difference. First operand 134 states and 155 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-01-10 06:05:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:32,501 INFO L93 Difference]: Finished difference Result 248 states and 300 transitions. [2025-01-10 06:05:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:05:32,502 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-01-10 06:05:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:32,503 INFO L225 Difference]: With dead ends: 248 [2025-01-10 06:05:32,504 INFO L226 Difference]: Without dead ends: 170 [2025-01-10 06:05:32,504 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-01-10 06:05:32,504 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:32,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 359 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:05:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-10 06:05:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-10 06:05:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 157 states have (on average 1.1656050955414012) internal successors, (183), 163 states have internal predecessors, (183), 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-01-10 06:05:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2025-01-10 06:05:32,517 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 69 [2025-01-10 06:05:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:32,518 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2025-01-10 06:05:32,518 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-01-10 06:05:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2025-01-10 06:05:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 06:05:32,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:32,520 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-01-10 06:05:32,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:05:32,720 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-01-10 06:05:32,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting xatoul_sfxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:05:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash -119235925, now seen corresponding path program 2 times [2025-01-10 06:05:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:05:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145605469] [2025-01-10 06:05:32,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:05:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:05:32,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-01-10 06:05:33,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 06:05:33,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:05:33,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:05:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:05:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145605469] [2025-01-10 06:05:41,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145605469] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:05:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117071642] [2025-01-10 06:05:41,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:05:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:41,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:41,095 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-01-10 06:05:41,096 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-01-10 06:05:41,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-01-10 06:06:08,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 06:06:08,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:06:08,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:06:08,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 1823 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-01-10 06:06:08,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:06:08,955 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-01-10 06:06:09,036 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 06:06:09,037 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-01-10 06:06:09,054 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-01-10 06:06:09,066 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-01-10 06:06:09,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:06:09,200 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 154 treesize of output 108 [2025-01-10 06:06:09,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:06:09,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:06:09,224 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 160 treesize of output 114 [2025-01-10 06:06:09,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:06:09,257 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2025-01-10 06:06:09,258 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 77 treesize of output 65 [2025-01-10 06:06:09,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:06:09,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2025-01-10 06:06:09,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:06:09,283 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-01-10 06:06:09,304 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-10 06:06:09,305 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-01-10 06:06:09,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:06:09,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 82 [2025-01-10 06:06:09,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:06:09,346 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-01-10 06:06:09,346 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 66 treesize of output 54 [2025-01-10 06:06:09,453 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:09,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:09,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:09,566 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:09,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:09,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:09,673 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:09,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:09,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:09,774 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:09,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:09,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:09,921 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:09,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:09,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:10,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:10,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:10,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:10,174 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:10,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:10,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:10,297 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:10,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:10,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:10,392 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:10,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:10,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:10,465 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:06:10,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 06:06:10,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2025-01-10 06:06:10,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:06:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-10 06:06:10,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:06:15,038 INFO L349 Elim1Store]: treesize reduction 32, result has 61.4 percent of original size [2025-01-10 06:06:15,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 6425 treesize of output 2660 [2025-01-10 06:06:15,103 INFO L349 Elim1Store]: treesize reduction 21, result has 50.0 percent of original size [2025-01-10 06:06:15,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2608 treesize of output 2614