./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:08:52,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:08:52,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:08:52,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:08:52,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:08:52,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:08:52,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:08:52,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:08:52,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:08:52,627 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:08:52,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:08:52,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:08:52,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:08:52,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:08:52,628 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:08:52,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:08:52,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:08:52,628 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:08:52,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:08:52,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:08:52,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:08:52,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:08:52,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:08:52,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:08:52,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:08:52,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:08:52,631 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 [2025-02-06 18:08:52,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:08:52,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:08:52,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:08:52,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:08:52,919 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:08:52,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2025-02-06 18:08:54,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5923f674/07522114ada14b95bdc4e142b450dd04/FLAG36a581364 [2025-02-06 18:08:54,640 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:08:54,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2025-02-06 18:08:54,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5923f674/07522114ada14b95bdc4e142b450dd04/FLAG36a581364 [2025-02-06 18:08:54,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5923f674/07522114ada14b95bdc4e142b450dd04 [2025-02-06 18:08:54,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:08:54,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:08:54,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:08:54,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:08:54,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:08:54,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:08:54" (1/1) ... [2025-02-06 18:08:54,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2c075f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:54, skipping insertion in model container [2025-02-06 18:08:54,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:08:54" (1/1) ... [2025-02-06 18:08:54,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:08:55,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:08:55,270 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:08:55,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:08:55,418 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:08:55,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55 WrapperNode [2025-02-06 18:08:55,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:08:55,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:08:55,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:08:55,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:08:55,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,537 INFO L138 Inliner]: procedures = 208, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1431 [2025-02-06 18:08:55,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:08:55,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:08:55,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:08:55,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:08:55,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,637 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-02-06 18:08:55,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:08:55,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:08:55,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:08:55,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:08:55,716 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (1/1) ... [2025-02-06 18:08:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:08:55,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:08:55,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:08:55,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:08:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 18:08:55,781 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 18:08:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:08:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:08:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:08:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:08:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:08:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:08:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:08:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:08:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:08:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:08:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:08:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:08:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:08:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:08:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 18:08:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 18:08:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:08:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:08:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:08:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:08:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:08:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:08:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:08:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:08:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:08:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:08:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:08:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:08:55,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:08:56,021 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:08:56,022 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:08:57,477 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 18:08:57,581 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-02-06 18:08:57,581 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:08:57,652 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:08:57,653 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 18:08:57,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:08:57 BoogieIcfgContainer [2025-02-06 18:08:57,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:08:57,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:08:57,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:08:57,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:08:57,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:08:54" (1/3) ... [2025-02-06 18:08:57,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c7629b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:08:57, skipping insertion in model container [2025-02-06 18:08:57,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:55" (2/3) ... [2025-02-06 18:08:57,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c7629b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:08:57, skipping insertion in model container [2025-02-06 18:08:57,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:08:57" (3/3) ... [2025-02-06 18:08:57,664 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-2.i [2025-02-06 18:08:57,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:08:57,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test2-2.i that has 6 procedures, 436 locations, 1 initial locations, 38 loop locations, and 8 error locations. [2025-02-06 18:08:57,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:08:57,753 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;@83c08a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:08:57,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 18:08:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 428 states, 406 states have (on average 1.6231527093596059) internal successors, (659), 421 states have internal predecessors, (659), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 18:08:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:08:57,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:57,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:57,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:08:57,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2087081458, now seen corresponding path program 1 times [2025-02-06 18:08:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:57,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294623569] [2025-02-06 18:08:57,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:57,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:57,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:08:57,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:08:57,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:57,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:57,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:57,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294623569] [2025-02-06 18:08:57,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294623569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:57,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:08:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627114880] [2025-02-06 18:08:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:57,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:08:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:57,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:08:57,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:08:57,946 INFO L87 Difference]: Start difference. First operand has 428 states, 406 states have (on average 1.6231527093596059) internal successors, (659), 421 states have internal predecessors, (659), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:58,088 INFO L93 Difference]: Finished difference Result 852 states and 1360 transitions. [2025-02-06 18:08:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:08:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:08:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:58,102 INFO L225 Difference]: With dead ends: 852 [2025-02-06 18:08:58,103 INFO L226 Difference]: Without dead ends: 386 [2025-02-06 18:08:58,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:08:58,113 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:58,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 570 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-06 18:08:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-02-06 18:08:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 368 states have (on average 1.4728260869565217) internal successors, (542), 380 states have internal predecessors, (542), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:08:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 558 transitions. [2025-02-06 18:08:58,183 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 558 transitions. Word has length 7 [2025-02-06 18:08:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:58,183 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 558 transitions. [2025-02-06 18:08:58,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 558 transitions. [2025-02-06 18:08:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:08:58,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:58,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:58,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:08:58,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:08:58,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2087082419, now seen corresponding path program 1 times [2025-02-06 18:08:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:58,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978974794] [2025-02-06 18:08:58,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:58,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:08:58,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:08:58,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:58,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 18:08:58,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946917761] [2025-02-06 18:08:58,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:58,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:08:58,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:08:58,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:08:58,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:08:58,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:08:58,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:58,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:58,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:08:58,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:08:58,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:08:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:58,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:08:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978974794] [2025-02-06 18:08:58,468 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 18:08:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946917761] [2025-02-06 18:08:58,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946917761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:58,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:08:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543766505] [2025-02-06 18:08:58,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:58,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:58,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:58,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:58,471 INFO L87 Difference]: Start difference. First operand 386 states and 558 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:58,758 INFO L93 Difference]: Finished difference Result 762 states and 1107 transitions. [2025-02-06 18:08:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:08:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:08:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:58,765 INFO L225 Difference]: With dead ends: 762 [2025-02-06 18:08:58,768 INFO L226 Difference]: Without dead ends: 760 [2025-02-06 18:08:58,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:08:58,769 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 526 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:58,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1476 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:08:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-02-06 18:08:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 392. [2025-02-06 18:08:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 374 states have (on average 1.467914438502674) internal successors, (549), 386 states have internal predecessors, (549), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:08:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 565 transitions. [2025-02-06 18:08:58,826 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 565 transitions. Word has length 7 [2025-02-06 18:08:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:58,826 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 565 transitions. [2025-02-06 18:08:58,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 565 transitions. [2025-02-06 18:08:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 18:08:58,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:58,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:58,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:08:59,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:59,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:08:59,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 327486595, now seen corresponding path program 1 times [2025-02-06 18:08:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:59,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159686992] [2025-02-06 18:08:59,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:59,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 18:08:59,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 18:08:59,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:59,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:59,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159686992] [2025-02-06 18:08:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159686992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:59,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:08:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653573262] [2025-02-06 18:08:59,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:59,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:59,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:59,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:59,512 INFO L87 Difference]: Start difference. First operand 392 states and 565 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:59,793 INFO L93 Difference]: Finished difference Result 938 states and 1367 transitions. [2025-02-06 18:08:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:08:59,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-02-06 18:08:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:59,798 INFO L225 Difference]: With dead ends: 938 [2025-02-06 18:08:59,798 INFO L226 Difference]: Without dead ends: 759 [2025-02-06 18:08:59,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:08:59,799 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 527 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:59,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1483 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:08:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-02-06 18:08:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 392. [2025-02-06 18:08:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 374 states have (on average 1.46524064171123) internal successors, (548), 386 states have internal predecessors, (548), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:08:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 564 transitions. [2025-02-06 18:08:59,828 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 564 transitions. Word has length 63 [2025-02-06 18:08:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 564 transitions. [2025-02-06 18:08:59,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 564 transitions. [2025-02-06 18:08:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 18:08:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:59,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:59,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:08:59,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:08:59,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:59,835 INFO L85 PathProgramCache]: Analyzing trace with hash -529516021, now seen corresponding path program 1 times [2025-02-06 18:08:59,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:59,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161757795] [2025-02-06 18:08:59,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:59,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:59,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 18:08:59,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 18:08:59,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:59,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:09:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161757795] [2025-02-06 18:09:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161757795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:09:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:09:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:09:00,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598016149] [2025-02-06 18:09:00,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:09:00,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:09:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:09:00,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:09:00,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:09:00,144 INFO L87 Difference]: Start difference. First operand 392 states and 564 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:09:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:00,327 INFO L93 Difference]: Finished difference Result 779 states and 1123 transitions. [2025-02-06 18:09:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:09:00,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-02-06 18:09:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:00,332 INFO L225 Difference]: With dead ends: 779 [2025-02-06 18:09:00,333 INFO L226 Difference]: Without dead ends: 395 [2025-02-06 18:09:00,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:09:00,334 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 105 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:00,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1386 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:09:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-06 18:09:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2025-02-06 18:09:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 374 states have (on average 1.446524064171123) internal successors, (541), 386 states have internal predecessors, (541), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:09:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 557 transitions. [2025-02-06 18:09:00,353 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 557 transitions. Word has length 80 [2025-02-06 18:09:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:00,353 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 557 transitions. [2025-02-06 18:09:00,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:09:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 557 transitions. [2025-02-06 18:09:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 18:09:00,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:00,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:00,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:09:00,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:09:00,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1915459740, now seen corresponding path program 1 times [2025-02-06 18:09:00,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836732227] [2025-02-06 18:09:00,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:00,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 18:09:00,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 18:09:00,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:00,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:09:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836732227] [2025-02-06 18:09:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836732227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:09:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:09:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:09:00,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510088999] [2025-02-06 18:09:00,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:09:00,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:09:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:09:00,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:09:00,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:09:00,562 INFO L87 Difference]: Start difference. First operand 392 states and 557 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:09:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:00,781 INFO L93 Difference]: Finished difference Result 1055 states and 1522 transitions. [2025-02-06 18:09:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:09:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-02-06 18:09:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:00,787 INFO L225 Difference]: With dead ends: 1055 [2025-02-06 18:09:00,788 INFO L226 Difference]: Without dead ends: 671 [2025-02-06 18:09:00,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:09:00,790 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 352 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:00,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1182 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:09:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-02-06 18:09:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 667. [2025-02-06 18:09:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 644 states have (on average 1.4673913043478262) internal successors, (945), 661 states have internal predecessors, (945), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:09:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 971 transitions. [2025-02-06 18:09:00,821 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 971 transitions. Word has length 80 [2025-02-06 18:09:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:00,823 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 971 transitions. [2025-02-06 18:09:00,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:09:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 971 transitions. [2025-02-06 18:09:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 18:09:00,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:00,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:00,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:09:00,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:09:00,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:00,827 INFO L85 PathProgramCache]: Analyzing trace with hash -711011528, now seen corresponding path program 1 times [2025-02-06 18:09:00,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:00,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820673371] [2025-02-06 18:09:00,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:00,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 18:09:00,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 18:09:00,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:00,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:09:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820673371] [2025-02-06 18:09:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820673371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:09:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:09:01,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:09:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034473600] [2025-02-06 18:09:01,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:09:01,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:09:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:09:01,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:09:01,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:09:01,137 INFO L87 Difference]: Start difference. First operand 667 states and 971 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:01,252 INFO L93 Difference]: Finished difference Result 1269 states and 1853 transitions. [2025-02-06 18:09:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:09:01,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2025-02-06 18:09:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:01,255 INFO L225 Difference]: With dead ends: 1269 [2025-02-06 18:09:01,255 INFO L226 Difference]: Without dead ends: 679 [2025-02-06 18:09:01,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:09:01,257 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:01,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 986 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:09:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-06 18:09:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-02-06 18:09:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 656 states have (on average 1.458841463414634) internal successors, (957), 673 states have internal predecessors, (957), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:09:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 983 transitions. [2025-02-06 18:09:01,277 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 983 transitions. Word has length 95 [2025-02-06 18:09:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:01,277 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 983 transitions. [2025-02-06 18:09:01,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 983 transitions. [2025-02-06 18:09:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 18:09:01,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:01,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:01,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:09:01,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:09:01,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash -502313225, now seen corresponding path program 1 times [2025-02-06 18:09:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758652777] [2025-02-06 18:09:01,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:01,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 18:09:01,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 18:09:01,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:01,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:09:01,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:01,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758652777] [2025-02-06 18:09:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758652777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:09:01,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:09:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:09:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305795614] [2025-02-06 18:09:01,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:09:01,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:09:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:09:01,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:09:01,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:09:01,681 INFO L87 Difference]: Start difference. First operand 679 states and 983 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:01,913 INFO L93 Difference]: Finished difference Result 939 states and 1362 transitions. [2025-02-06 18:09:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:09:01,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2025-02-06 18:09:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:01,921 INFO L225 Difference]: With dead ends: 939 [2025-02-06 18:09:01,921 INFO L226 Difference]: Without dead ends: 937 [2025-02-06 18:09:01,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:09:01,923 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 435 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:01,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1535 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:09:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-06 18:09:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 742. [2025-02-06 18:09:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 716 states have (on average 1.4441340782122905) internal successors, (1034), 733 states have internal predecessors, (1034), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 18:09:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1066 transitions. [2025-02-06 18:09:01,948 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1066 transitions. Word has length 95 [2025-02-06 18:09:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:01,948 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1066 transitions. [2025-02-06 18:09:01,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1066 transitions. [2025-02-06 18:09:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 18:09:01,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:01,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:01,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:09:01,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:09:01,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1842306297, now seen corresponding path program 1 times [2025-02-06 18:09:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414833532] [2025-02-06 18:09:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:01,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 18:09:02,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 18:09:02,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:02,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:09:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414833532] [2025-02-06 18:09:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414833532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:09:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986264772] [2025-02-06 18:09:02,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:02,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:09:02,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:09:02,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:09:02,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:09:02,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 18:09:02,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 18:09:02,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:02,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:02,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 18:09:02,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:09:02,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:09:02,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:09:02,860 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 18:09:03,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:09:03,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2025-02-06 18:09:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:09:03,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:09:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986264772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:09:03,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:09:03,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:09:03,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472483455] [2025-02-06 18:09:03,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:09:03,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:09:03,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:09:03,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:09:03,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:09:03,550 INFO L87 Difference]: Start difference. First operand 742 states and 1066 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:07,657 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 [0] [2025-02-06 18:09:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:10,657 INFO L93 Difference]: Finished difference Result 1626 states and 2346 transitions. [2025-02-06 18:09:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:09:10,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-02-06 18:09:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:10,663 INFO L225 Difference]: With dead ends: 1626 [2025-02-06 18:09:10,663 INFO L226 Difference]: Without dead ends: 977 [2025-02-06 18:09:10,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:09:10,665 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 790 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:10,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2779 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1136 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2025-02-06 18:09:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-06 18:09:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 773. [2025-02-06 18:09:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 747 states have (on average 1.4323962516733602) internal successors, (1070), 764 states have internal predecessors, (1070), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 18:09:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1102 transitions. [2025-02-06 18:09:10,687 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1102 transitions. Word has length 101 [2025-02-06 18:09:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:10,687 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1102 transitions. [2025-02-06 18:09:10,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1102 transitions. [2025-02-06 18:09:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 18:09:10,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:10,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:10,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:09:10,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:09:10,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:09:10,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash -975254072, now seen corresponding path program 1 times [2025-02-06 18:09:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624446697] [2025-02-06 18:09:10,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:10,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 18:09:10,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 18:09:10,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:10,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:09:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624446697] [2025-02-06 18:09:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624446697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:09:11,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:09:11,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:09:11,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667631441] [2025-02-06 18:09:11,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:09:11,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:09:11,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:09:11,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:09:11,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:09:11,037 INFO L87 Difference]: Start difference. First operand 773 states and 1102 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:11,219 INFO L93 Difference]: Finished difference Result 1374 states and 1964 transitions. [2025-02-06 18:09:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:09:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-02-06 18:09:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:11,223 INFO L225 Difference]: With dead ends: 1374 [2025-02-06 18:09:11,223 INFO L226 Difference]: Without dead ends: 634 [2025-02-06 18:09:11,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:09:11,226 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 9 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:11,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1253 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:09:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-06 18:09:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2025-02-06 18:09:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 608 states have (on average 1.4161184210526316) internal successors, (861), 625 states have internal predecessors, (861), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 18:09:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 893 transitions. [2025-02-06 18:09:11,270 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 893 transitions. Word has length 101 [2025-02-06 18:09:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:11,271 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 893 transitions. [2025-02-06 18:09:11,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 893 transitions. [2025-02-06 18:09:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 18:09:11,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:11,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:11,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:09:11,273 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:09:11,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash -29394025, now seen corresponding path program 1 times [2025-02-06 18:09:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473098432] [2025-02-06 18:09:11,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:11,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:09:11,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:09:11,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:11,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:09:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473098432] [2025-02-06 18:09:11,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473098432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:09:11,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497734520] [2025-02-06 18:09:11,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:11,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:09:11,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:09:11,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:09:11,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:09:11,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:09:12,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:09:12,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:12,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:12,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 18:09:12,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:09:43,225 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:09:55,236 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:10:11,599 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:10:22,203 WARN L286 SmtUtils]: Spent 10.60s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)