./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/array-multidimensional/copy-partial-2-n-u.c -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 2a46b64c20324a7544dfe7936b5f39eaa32bba659068797748195a7f292bdaee --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:51:06,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:51:06,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:51:06,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:51:06,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:51:06,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:51:06,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:51:06,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:51:06,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:51:06,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:51:06,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:51:06,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:51:06,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:51:06,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:51:06,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:51:06,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:51:06,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:06,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:51:06,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:51:06,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:51:06,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:51:06,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:51:06,572 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 -> 2a46b64c20324a7544dfe7936b5f39eaa32bba659068797748195a7f292bdaee [2025-02-08 08:51:06,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:51:06,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:51:06,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:51:06,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:51:06,831 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:51:06,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c [2025-02-08 08:51:08,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7375a738b/17c7115fda1c46f78073a464810a888d/FLAG8a581ecb8 [2025-02-08 08:51:08,343 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:51:08,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c [2025-02-08 08:51:08,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7375a738b/17c7115fda1c46f78073a464810a888d/FLAG8a581ecb8 [2025-02-08 08:51:08,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7375a738b/17c7115fda1c46f78073a464810a888d [2025-02-08 08:51:08,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:51:08,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:51:08,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:08,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:51:08,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:51:08,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a01903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08, skipping insertion in model container [2025-02-08 08:51:08,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:51:08,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:08,885 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:51:08,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:08,910 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:51:08,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08 WrapperNode [2025-02-08 08:51:08,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:08,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:08,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:51:08,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:51:08,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,937 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2025-02-08 08:51:08,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:08,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:51:08,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:51:08,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:51:08,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,954 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-08 08:51:08,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:51:08,969 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:51:08,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:51:08,969 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:51:08,970 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (1/1) ... [2025-02-08 08:51:08,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:08,998 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-08 08:51:09,000 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-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 08:51:09,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:51:09,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:51:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:51:09,084 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:51:09,086 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:51:09,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: assume 1 + main_~j~0#1 <= 2147483647;main_~j~0#1 := 1 + main_~j~0#1; [2025-02-08 08:51:09,325 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: assume !(1 + main_~j~0#1 <= 2147483647); [2025-02-08 08:51:09,325 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-1: assume 1 + main_~j~0#1 >= -2147483648; [2025-02-08 08:51:09,325 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-1: assume !(1 + main_~j~0#1 >= -2147483648); [2025-02-08 08:51:09,325 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1;havoc main_#t~mem7#1; [2025-02-08 08:51:09,325 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-02-08 08:51:09,334 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-08 08:51:09,334 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:51:09,343 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:51:09,344 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:51:09,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:09 BoogieIcfgContainer [2025-02-08 08:51:09,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:51:09,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:51:09,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:51:09,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:51:09,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:51:08" (1/3) ... [2025-02-08 08:51:09,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552d1538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:09, skipping insertion in model container [2025-02-08 08:51:09,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:08" (2/3) ... [2025-02-08 08:51:09,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552d1538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:09, skipping insertion in model container [2025-02-08 08:51:09,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:09" (3/3) ... [2025-02-08 08:51:09,355 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-partial-2-n-u.c [2025-02-08 08:51:09,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:51:09,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-partial-2-n-u.c that has 2 procedures, 39 locations, 1 initial locations, 6 loop locations, and 12 error locations. [2025-02-08 08:51:09,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:51:09,443 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;@5ac1db71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:51:09,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 08:51:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.75) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:51:09,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:09,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:09,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:09,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 544798251, now seen corresponding path program 1 times [2025-02-08 08:51:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617703227] [2025-02-08 08:51:09,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:09,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:09,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:09,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:09,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:09,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:09,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617703227] [2025-02-08 08:51:09,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617703227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:09,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70168965] [2025-02-08 08:51:09,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:09,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:09,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:09,611 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-08 08:51:09,612 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-08 08:51:09,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:09,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:09,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:09,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:09,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 08:51:09,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:09,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:51:09,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70168965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:09,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:51:09,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 08:51:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97239175] [2025-02-08 08:51:09,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:09,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:51:09,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:09,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:51:09,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:51:09,734 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.75) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:09,748 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2025-02-08 08:51:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:51:09,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-02-08 08:51:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:09,754 INFO L225 Difference]: With dead ends: 76 [2025-02-08 08:51:09,754 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 08:51:09,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-08 08:51:09,759 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:09,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 08:51:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 08:51:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-02-08 08:51:09,790 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 15 [2025-02-08 08:51:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:09,790 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-08 08:51:09,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-02-08 08:51:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:51:09,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:09,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:09,800 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-08 08:51:09,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 08:51:09,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:09,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1561384651, now seen corresponding path program 1 times [2025-02-08 08:51:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545901011] [2025-02-08 08:51:09,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:10,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:10,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:10,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:10,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:10,127 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-08 08:51:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545901011] [2025-02-08 08:51:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545901011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:10,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:10,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981746473] [2025-02-08 08:51:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:10,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:10,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:10,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:10,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:10,131 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-08 08:51:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:10,198 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-02-08 08:51:10,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:10,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 15 [2025-02-08 08:51:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:10,203 INFO L225 Difference]: With dead ends: 44 [2025-02-08 08:51:10,203 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 08:51:10,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:10,204 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:10,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 08:51:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 08:51:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-02-08 08:51:10,209 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 15 [2025-02-08 08:51:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:10,210 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-02-08 08:51:10,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-08 08:51:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-02-08 08:51:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:51:10,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:10,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:10,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:51:10,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:10,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1561384678, now seen corresponding path program 1 times [2025-02-08 08:51:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615505018] [2025-02-08 08:51:10,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:10,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:10,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:10,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:10,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:10,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:10,339 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-08 08:51:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615505018] [2025-02-08 08:51:10,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615505018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:10,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:10,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:51:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535373027] [2025-02-08 08:51:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:10,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:10,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:10,341 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-08 08:51:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:10,408 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-02-08 08:51:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:10,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 15 [2025-02-08 08:51:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:10,410 INFO L225 Difference]: With dead ends: 72 [2025-02-08 08:51:10,410 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 08:51:10,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:10,411 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:10,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 50 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 08:51:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 08:51:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 36 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-02-08 08:51:10,421 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2025-02-08 08:51:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:10,421 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-08 08:51:10,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-08 08:51:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-02-08 08:51:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:51:10,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:10,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:10,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:51:10,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:10,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1157946331, now seen corresponding path program 1 times [2025-02-08 08:51:10,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:10,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279174762] [2025-02-08 08:51:10,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:10,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:10,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:51:10,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:51:10,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:10,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:10,544 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-08 08:51:10,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279174762] [2025-02-08 08:51:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279174762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:10,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:10,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:51:10,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286690056] [2025-02-08 08:51:10,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:10,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:10,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:10,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:10,548 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-08 08:51:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:10,594 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-02-08 08:51:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:10,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 16 [2025-02-08 08:51:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:10,595 INFO L225 Difference]: With dead ends: 72 [2025-02-08 08:51:10,596 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 08:51:10,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:10,598 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:10,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 62 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 08:51:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-08 08:51:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.5) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2025-02-08 08:51:10,611 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 16 [2025-02-08 08:51:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:10,611 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2025-02-08 08:51:10,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-08 08:51:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2025-02-08 08:51:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 08:51:10,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:10,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:51:10,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:10,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash 714332317, now seen corresponding path program 1 times [2025-02-08 08:51:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243893592] [2025-02-08 08:51:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:10,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:51:10,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:51:10,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:10,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243893592] [2025-02-08 08:51:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243893592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239782093] [2025-02-08 08:51:10,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:10,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:10,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:10,682 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-08 08:51:10,684 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-08 08:51:10,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:51:10,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:51:10,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:10,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:10,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:10,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:10,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:51:10,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239782093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:10,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:51:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 08:51:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432979575] [2025-02-08 08:51:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:10,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:10,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:10,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:51:10,787 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-08 08:51:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:10,837 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-02-08 08:51:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 18 [2025-02-08 08:51:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:10,838 INFO L225 Difference]: With dead ends: 49 [2025-02-08 08:51:10,838 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 08:51:10,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-08 08:51:10,839 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:10,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 08:51:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 08:51:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 43 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-02-08 08:51:10,851 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2025-02-08 08:51:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:10,851 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-02-08 08:51:10,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-08 08:51:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-02-08 08:51:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:51:10,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:10,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:10,861 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-08 08:51:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:11,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 669465357, now seen corresponding path program 1 times [2025-02-08 08:51:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:11,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681343628] [2025-02-08 08:51:11,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:11,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:51:11,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:51:11,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:11,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681343628] [2025-02-08 08:51:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681343628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387839496] [2025-02-08 08:51:11,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:11,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:11,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:11,143 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-08 08:51:11,146 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-08 08:51:11,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:51:11,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:51:11,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:11,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:11,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:11,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:11,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:51:11,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387839496] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:11,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:11,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 08:51:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577303594] [2025-02-08 08:51:11,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:11,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:51:11,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:11,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:51:11,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:11,274 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-08 08:51:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:11,353 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2025-02-08 08:51:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:51:11,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 19 [2025-02-08 08:51:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:11,355 INFO L225 Difference]: With dead ends: 76 [2025-02-08 08:51:11,355 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 08:51:11,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:11,356 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:11,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 08:51:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 08:51:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.380952380952381) internal successors, (87), 70 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2025-02-08 08:51:11,372 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 19 [2025-02-08 08:51:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:11,373 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2025-02-08 08:51:11,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-08 08:51:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2025-02-08 08:51:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 08:51:11,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:11,374 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] [2025-02-08 08:51:11,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:51:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:11,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:11,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1248181382, now seen corresponding path program 1 times [2025-02-08 08:51:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386253627] [2025-02-08 08:51:11,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:11,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:51:11,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:51:11,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:11,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:51:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386253627] [2025-02-08 08:51:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386253627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:11,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:11,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:51:11,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052353711] [2025-02-08 08:51:11,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:11,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:11,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:11,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:11,644 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08 08:51:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:11,686 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2025-02-08 08:51:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 23 [2025-02-08 08:51:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:11,687 INFO L225 Difference]: With dead ends: 97 [2025-02-08 08:51:11,687 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 08:51:11,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:11,688 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:11,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 46 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 08:51:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-08 08:51:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 64 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2025-02-08 08:51:11,702 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 23 [2025-02-08 08:51:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:11,702 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2025-02-08 08:51:11,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08 08:51:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2025-02-08 08:51:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 08:51:11,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:11,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:11,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:51:11,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1530870435, now seen corresponding path program 1 times [2025-02-08 08:51:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949817445] [2025-02-08 08:51:11,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:11,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:51:11,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:51:11,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:11,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:51:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949817445] [2025-02-08 08:51:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949817445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240799786] [2025-02-08 08:51:11,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:11,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:11,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:51:11,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:51:11,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:51:11,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:11,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:11,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:51:11,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:51:11,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:51:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240799786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:11,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-02-08 08:51:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337536501] [2025-02-08 08:51:11,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:11,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:51:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:11,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:51:11,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:51:11,978 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:51:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:12,263 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2025-02-08 08:51:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:51:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2025-02-08 08:51:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:12,265 INFO L225 Difference]: With dead ends: 130 [2025-02-08 08:51:12,265 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 08:51:12,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:51:12,266 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 237 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:12,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 39 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:51:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 08:51:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-02-08 08:51:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 80 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2025-02-08 08:51:12,281 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 25 [2025-02-08 08:51:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:12,281 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2025-02-08 08:51:12,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:51:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2025-02-08 08:51:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 08:51:12,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:12,282 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:12,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:51:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 08:51:12,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:12,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:12,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1151472927, now seen corresponding path program 2 times [2025-02-08 08:51:12,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193040739] [2025-02-08 08:51:12,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:12,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 08:51:12,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 28 statements. [2025-02-08 08:51:12,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:12,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:51:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:12,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193040739] [2025-02-08 08:51:12,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193040739] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:12,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489449951] [2025-02-08 08:51:12,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:12,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:12,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:12,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:12,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:51:12,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 08:51:12,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 28 statements. [2025-02-08 08:51:12,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:12,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:12,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:12,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:51:12,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:51:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489449951] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:12,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:12,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 08:51:12,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910237733] [2025-02-08 08:51:12,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:12,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:12,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:12,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:12,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:12,707 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 08:51:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:12,758 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2025-02-08 08:51:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:51:12,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-02-08 08:51:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:12,760 INFO L225 Difference]: With dead ends: 84 [2025-02-08 08:51:12,760 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 08:51:12,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:51:12,761 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:12,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 59 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 08:51:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-02-08 08:51:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 75 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2025-02-08 08:51:12,776 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 28 [2025-02-08 08:51:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:12,776 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2025-02-08 08:51:12,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 08:51:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2025-02-08 08:51:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 08:51:12,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:12,777 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:12,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:51:12,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:12,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:12,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash -702527675, now seen corresponding path program 1 times [2025-02-08 08:51:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819161219] [2025-02-08 08:51:12,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:12,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 08:51:12,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 08:51:12,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:12,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-08 08:51:13,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:13,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819161219] [2025-02-08 08:51:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819161219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:13,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885933084] [2025-02-08 08:51:13,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:13,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:13,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:51:13,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 08:51:13,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 08:51:13,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:51:13,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:51:13,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:51:13,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885933084] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:13,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:13,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-02-08 08:51:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585772725] [2025-02-08 08:51:13,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:13,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:51:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:13,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:51:13,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:51:13,384 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:51:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:14,038 INFO L93 Difference]: Finished difference Result 280 states and 365 transitions. [2025-02-08 08:51:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-08 08:51:14,038 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2025-02-08 08:51:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:14,041 INFO L225 Difference]: With dead ends: 280 [2025-02-08 08:51:14,041 INFO L226 Difference]: Without dead ends: 223 [2025-02-08 08:51:14,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 08:51:14,042 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 448 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:14,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 44 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:51:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-08 08:51:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 176. [2025-02-08 08:51:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 170 states have (on average 1.1470588235294117) internal successors, (195), 172 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2025-02-08 08:51:14,071 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 43 [2025-02-08 08:51:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:14,071 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2025-02-08 08:51:14,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:51:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2025-02-08 08:51:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 08:51:14,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:14,074 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:14,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:51:14,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 08:51:14,275 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:14,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash -735870209, now seen corresponding path program 1 times [2025-02-08 08:51:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:14,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434131521] [2025-02-08 08:51:14,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:14,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 08:51:14,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 08:51:14,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:14,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 08:51:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434131521] [2025-02-08 08:51:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434131521] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659258805] [2025-02-08 08:51:14,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:14,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:14,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:14,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:14,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:51:14,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 08:51:14,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 08:51:14,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:14,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:51:14,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 08:51:14,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-08 08:51:15,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659258805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:15,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:15,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 14, 14] total 28 [2025-02-08 08:51:15,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950032522] [2025-02-08 08:51:15,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:15,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 08:51:15,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:15,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 08:51:15,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=438, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:51:15,027 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand has 28 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:51:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:15,587 INFO L93 Difference]: Finished difference Result 485 states and 608 transitions. [2025-02-08 08:51:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 08:51:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 66 [2025-02-08 08:51:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:15,590 INFO L225 Difference]: With dead ends: 485 [2025-02-08 08:51:15,590 INFO L226 Difference]: Without dead ends: 349 [2025-02-08 08:51:15,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=1662, Unknown=0, NotChecked=0, Total=2652 [2025-02-08 08:51:15,593 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 232 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:15,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 82 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:51:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-08 08:51:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 250. [2025-02-08 08:51:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.0408163265306123) internal successors, (255), 246 states have internal predecessors, (255), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 259 transitions. [2025-02-08 08:51:15,632 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 259 transitions. Word has length 66 [2025-02-08 08:51:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:15,632 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 259 transitions. [2025-02-08 08:51:15,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:51:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 259 transitions. [2025-02-08 08:51:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 08:51:15,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:15,636 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:15,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:15,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:15,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:15,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:15,837 INFO L85 PathProgramCache]: Analyzing trace with hash -274265330, now seen corresponding path program 2 times [2025-02-08 08:51:15,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:15,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162197952] [2025-02-08 08:51:15,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:15,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:15,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-02-08 08:51:15,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 107 statements. [2025-02-08 08:51:15,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:15,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2025-02-08 08:51:15,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:15,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162197952] [2025-02-08 08:51:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162197952] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:15,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218943885] [2025-02-08 08:51:15,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:15,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:15,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:15,883 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:15,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:51:15,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-02-08 08:51:15,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 107 statements. [2025-02-08 08:51:15,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:15,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:15,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2025-02-08 08:51:16,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2025-02-08 08:51:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218943885] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:16,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:16,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 08:51:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533815327] [2025-02-08 08:51:16,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:16,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:16,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:16,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:16,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:16,223 INFO L87 Difference]: Start difference. First operand 250 states and 259 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 08:51:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:16,274 INFO L93 Difference]: Finished difference Result 250 states and 259 transitions. [2025-02-08 08:51:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:51:16,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 107 [2025-02-08 08:51:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:16,276 INFO L225 Difference]: With dead ends: 250 [2025-02-08 08:51:16,276 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 08:51:16,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:51:16,277 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:16,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 08:51:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-02-08 08:51:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 224 states have (on average 1.0178571428571428) internal successors, (228), 224 states have internal predecessors, (228), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:51:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 232 transitions. [2025-02-08 08:51:16,295 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 232 transitions. Word has length 107 [2025-02-08 08:51:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:16,296 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 232 transitions. [2025-02-08 08:51:16,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 08:51:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2025-02-08 08:51:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-08 08:51:16,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:16,298 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:16,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:51:16,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:16,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 08:51:16,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash -646630354, now seen corresponding path program 1 times [2025-02-08 08:51:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881736337] [2025-02-08 08:51:16,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:16,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-08 08:51:16,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-08 08:51:16,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:16,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 0 proven. 3272 refuted. 0 times theorem prover too weak. 3989 trivial. 0 not checked. [2025-02-08 08:51:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881736337] [2025-02-08 08:51:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881736337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072114697] [2025-02-08 08:51:16,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:16,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:16,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:16,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:16,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:51:17,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-08 08:51:17,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-08 08:51:17,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:17,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:17,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 08:51:17,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 3270 proven. 782 refuted. 0 times theorem prover too weak. 3209 trivial. 0 not checked. [2025-02-08 08:51:17,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 3270 proven. 782 refuted. 0 times theorem prover too weak. 3209 trivial. 0 not checked. [2025-02-08 08:51:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072114697] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:18,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 27, 27] total 54 [2025-02-08 08:51:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093772106] [2025-02-08 08:51:18,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:18,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-08 08:51:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:18,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-08 08:51:18,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2025-02-08 08:51:18,568 INFO L87 Difference]: Start difference. First operand 228 states and 232 transitions. Second operand has 54 states, 54 states have (on average 3.2037037037037037) internal successors, (173), 54 states have internal predecessors, (173), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:51:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:20,125 INFO L93 Difference]: Finished difference Result 601 states and 683 transitions. [2025-02-08 08:51:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-08 08:51:20,125 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.2037037037037037) internal successors, (173), 54 states have internal predecessors, (173), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 231 [2025-02-08 08:51:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:20,126 INFO L225 Difference]: With dead ends: 601 [2025-02-08 08:51:20,126 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:51:20,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3982, Invalid=6730, Unknown=0, NotChecked=0, Total=10712 [2025-02-08 08:51:20,129 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 158 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:20,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 68 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:51:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:51:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:51:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08 08:51:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:51:20,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2025-02-08 08:51:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:20,130 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:51:20,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.2037037037037037) internal successors, (173), 54 states have internal predecessors, (173), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:51:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:51:20,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-02-08 08:51:20,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-02-08 08:51:20,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:20,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:20,337 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:20,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:51:23,579 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:51:23,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:51:23 BoogieIcfgContainer [2025-02-08 08:51:23,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:51:23,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:51:23,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:51:23,598 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:51:23,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:09" (3/4) ... [2025-02-08 08:51:23,603 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:51:23,606 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 08:51:23,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 08:51:23,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:51:23,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:51:23,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:51:23,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:51:23,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:51:23,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:51:23,692 INFO L158 Benchmark]: Toolchain (without parser) took 14994.44ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 106.6MB in the beginning and 335.3MB in the end (delta: -228.7MB). Peak memory consumption was 186.7MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,692 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:23,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.31ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.20ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:23,692 INFO L158 Benchmark]: Boogie Preprocessor took 30.35ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.1MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,693 INFO L158 Benchmark]: IcfgBuilder took 376.67ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 78.4MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,693 INFO L158 Benchmark]: TraceAbstraction took 14249.33ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 78.4MB in the beginning and 339.3MB in the end (delta: -260.9MB). Peak memory consumption was 310.8MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,693 INFO L158 Benchmark]: Witness Printer took 93.43ms. Allocated memory is still 562.0MB. Free memory was 339.3MB in the beginning and 335.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:23,696 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.31ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.20ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.35ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.1MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 376.67ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 78.4MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14249.33ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 78.4MB in the beginning and 339.3MB in the end (delta: -260.9MB). Peak memory consumption was 310.8MB. Max. memory is 16.1GB. * Witness Printer took 93.43ms. Allocated memory is still 562.0MB. Free memory was 339.3MB in the beginning and 335.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 13, TraceHistogramMax: 69, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 744 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 443 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 301 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1237 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3191 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=11, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 154 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1663 ConstructedInterpolants, 0 QuantifiedInterpolants, 4329 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1801 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 19852/25136 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 47]: Location Invariant Derived location invariant: ((((((((i == 0) && (q <= 500)) && (s == 700)) && (j == 0)) && (n == 1500)) || ((((((i == 0) && (q <= 500)) && (j <= 1489)) && (1 <= j)) && (s == 700)) && (n == 1500))) || ((((((q <= 500) && (1 <= i)) && (i <= 499)) && (s == 700)) && (j == 0)) && (n == 1500))) || (((((((q <= 500) && (1 <= i)) && (j <= 1489)) && (1 <= j)) && (i <= 499)) && (s == 700)) && (n == 1500))) - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((((((((m == 1000) && (q <= 500)) && (1 <= i)) && (i <= 999)) && (s == 700)) && (j == 0)) && (n == 1500)) || ((((((i == 0) && (m == 1000)) && (q <= 500)) && (s == 700)) && (j == 0)) && (n == 1500))) || (((((((i == 0) && (m == 1000)) && (q <= 500)) && (1 <= j)) && (j <= 2147483646)) && (s == 700)) && (n == 1500))) || ((((((((m == 1000) && (q <= 500)) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (s == 700)) && (n == 1500))) - InvariantResult [Line: 61]: Location Invariant Derived location invariant: ((700 <= s) && (1500 <= n)) - InvariantResult [Line: 63]: Location Invariant Derived location invariant: (((700 <= s) && (1500 <= n)) && (j == 0)) - InvariantResult [Line: 45]: Location Invariant Derived location invariant: ((((((q <= 500) && (1 <= i)) && (i <= 2147483646)) && (s == 700)) && (n == 1500)) || ((((i == 0) && (q <= 500)) && (s == 700)) && (n == 1500))) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((((((i == 0) && (m == 1000)) && (q <= 500)) && (s == 700)) && (n == 1500)) || (((((m == 1000) && (q <= 500)) && (1 <= i)) && (s == 700)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:51:23,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE