./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i --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/uthash-2.0.2/uthash_OAT_test7-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:45:17,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:45:17,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:45:17,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:45:17,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:45:17,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:45:17,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:45:17,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:45:17,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:45:17,518 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:45:17,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:45:17,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:45:17,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:45:17,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:45:17,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:45:17,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:45:17,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:45:17,523 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 -> 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 [2025-02-08 13:45:17,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:45:17,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:45:17,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:45:17,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:45:17,784 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:45:17,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2025-02-08 13:45:18,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dba286c30/24dcd1eb494940b6ad284d278f508cbc/FLAG4d3c8d830 [2025-02-08 13:45:19,236 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:45:19,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2025-02-08 13:45:19,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dba286c30/24dcd1eb494940b6ad284d278f508cbc/FLAG4d3c8d830 [2025-02-08 13:45:19,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dba286c30/24dcd1eb494940b6ad284d278f508cbc [2025-02-08 13:45:19,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:45:19,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:45:19,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:45:19,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:45:19,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:45:19,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:19,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b5815b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19, skipping insertion in model container [2025-02-08 13:45:19,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:19,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:45:19,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:45:19,772 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:45:19,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:45:19,902 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:45:19,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19 WrapperNode [2025-02-08 13:45:19,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:45:19,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:45:19,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:45:19,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:45:19,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:19,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:19,996 INFO L138 Inliner]: procedures = 176, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1384 [2025-02-08 13:45:20,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:45:20,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:45:20,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:45:20,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:45:20,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,078 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-08 13:45:20,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:45:20,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:45:20,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:45:20,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:45:20,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (1/1) ... [2025-02-08 13:45:20,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:45:20,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:20,152 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 13:45:20,154 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 13:45:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:45:20,172 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:45:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:45:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:45:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:45:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:45:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:45:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:45:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:45:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:45:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:45:20,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:45:20,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:45:20,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:45:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:45:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:45:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:45:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:45:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:45:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:45:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:45:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:45:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:45:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:45:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:45:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:45:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:45:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:45:20,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:45:20,321 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:45:20,323 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:45:21,415 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 13:45:21,474 INFO L? ?]: Removed 319 outVars from TransFormulas that were not future-live. [2025-02-08 13:45:21,475 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:45:21,510 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:45:21,510 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:45:21,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:45:21 BoogieIcfgContainer [2025-02-08 13:45:21,510 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:45:21,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:45:21,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:45:21,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:45:21,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:45:19" (1/3) ... [2025-02-08 13:45:21,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c54d7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:45:21, skipping insertion in model container [2025-02-08 13:45:21,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:19" (2/3) ... [2025-02-08 13:45:21,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c54d7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:45:21, skipping insertion in model container [2025-02-08 13:45:21,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:45:21" (3/3) ... [2025-02-08 13:45:21,516 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-1.i [2025-02-08 13:45:21,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:45:21,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test7-1.i that has 5 procedures, 412 locations, 1 initial locations, 38 loop locations, and 6 error locations. [2025-02-08 13:45:21,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:45:21,569 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;@1227702d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:45:21,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:45:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 390 states have (on average 1.623076923076923) internal successors, (633), 397 states have internal predecessors, (633), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:45:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:45:21,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:21,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:45:21,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:21,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:21,579 INFO L85 PathProgramCache]: Analyzing trace with hash -117525639, now seen corresponding path program 1 times [2025-02-08 13:45:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967107285] [2025-02-08 13:45:21,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:21,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:45:21,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:45:21,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:21,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:21,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967107285] [2025-02-08 13:45:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967107285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:21,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:21,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:21,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735223143] [2025-02-08 13:45:21,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:21,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:45:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:21,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:45:21,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:45:21,698 INFO L87 Difference]: Start difference. First operand has 404 states, 390 states have (on average 1.623076923076923) internal successors, (633), 397 states have internal predecessors, (633), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 13:45:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:21,812 INFO L93 Difference]: Finished difference Result 804 states and 1283 transitions. [2025-02-08 13:45:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:45:21,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:45:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:21,820 INFO L225 Difference]: With dead ends: 804 [2025-02-08 13:45:21,820 INFO L226 Difference]: Without dead ends: 393 [2025-02-08 13:45:21,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:45:21,824 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:21,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 533 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-08 13:45:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-02-08 13:45:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 383 states have (on average 1.4621409921671018) internal successors, (560), 388 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 566 transitions. [2025-02-08 13:45:21,859 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 566 transitions. Word has length 6 [2025-02-08 13:45:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:21,859 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 566 transitions. [2025-02-08 13:45:21,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 13:45:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 566 transitions. [2025-02-08 13:45:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:45:21,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:21,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:45:21,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:45:21,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:21,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:21,861 INFO L85 PathProgramCache]: Analyzing trace with hash -117524678, now seen corresponding path program 1 times [2025-02-08 13:45:21,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:21,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288854896] [2025-02-08 13:45:21,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:21,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:21,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:45:21,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:45:21,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:21,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:45:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708180530] [2025-02-08 13:45:21,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:21,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:21,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:21,897 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 13:45:21,898 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 13:45:21,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:45:22,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:45:22,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:22,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:22,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:45:22,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:22,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:45:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:22,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:22,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:22,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288854896] [2025-02-08 13:45:22,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:45:22,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708180530] [2025-02-08 13:45:22,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708180530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:22,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:22,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458919850] [2025-02-08 13:45:22,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:22,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:22,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:22,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:22,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:22,072 INFO L87 Difference]: Start difference. First operand 393 states and 566 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13:45:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:22,297 INFO L93 Difference]: Finished difference Result 781 states and 1127 transitions. [2025-02-08 13:45:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:22,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:45:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:22,301 INFO L225 Difference]: With dead ends: 781 [2025-02-08 13:45:22,301 INFO L226 Difference]: Without dead ends: 779 [2025-02-08 13:45:22,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 13:45:22,302 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 548 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:22,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1576 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:45:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-02-08 13:45:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 399. [2025-02-08 13:45:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 389 states have (on average 1.4575835475578407) internal successors, (567), 394 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 573 transitions. [2025-02-08 13:45:22,333 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 573 transitions. Word has length 6 [2025-02-08 13:45:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:22,333 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 573 transitions. [2025-02-08 13:45:22,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13:45:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 573 transitions. [2025-02-08 13:45:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 13:45:22,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:22,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:22,346 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 13:45:22,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:22,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash -392830597, now seen corresponding path program 1 times [2025-02-08 13:45:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:22,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462292841] [2025-02-08 13:45:22,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:22,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:22,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 13:45:22,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 13:45:22,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:22,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:22,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:22,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462292841] [2025-02-08 13:45:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462292841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:22,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:22,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:22,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115610578] [2025-02-08 13:45:22,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:22,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:22,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:22,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:22,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:22,950 INFO L87 Difference]: Start difference. First operand 399 states and 573 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 13:45:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:23,162 INFO L93 Difference]: Finished difference Result 965 states and 1396 transitions. [2025-02-08 13:45:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-08 13:45:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:23,165 INFO L225 Difference]: With dead ends: 965 [2025-02-08 13:45:23,165 INFO L226 Difference]: Without dead ends: 778 [2025-02-08 13:45:23,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:45:23,167 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 549 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:23,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1581 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:45:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-02-08 13:45:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 399. [2025-02-08 13:45:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 389 states have (on average 1.455012853470437) internal successors, (566), 394 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 572 transitions. [2025-02-08 13:45:23,178 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 572 transitions. Word has length 69 [2025-02-08 13:45:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:23,178 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 572 transitions. [2025-02-08 13:45:23,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 13:45:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 572 transitions. [2025-02-08 13:45:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:45:23,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:23,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:23,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:45:23,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:23,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash -793837634, now seen corresponding path program 1 times [2025-02-08 13:45:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:23,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924773899] [2025-02-08 13:45:23,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:23,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:45:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:45:23,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:23,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924773899] [2025-02-08 13:45:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924773899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:45:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861436439] [2025-02-08 13:45:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:23,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:23,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:23,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:23,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:23,432 INFO L87 Difference]: Start difference. First operand 399 states and 572 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 13:45:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:23,580 INFO L93 Difference]: Finished difference Result 794 states and 1140 transitions. [2025-02-08 13:45:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 13:45:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:23,582 INFO L225 Difference]: With dead ends: 794 [2025-02-08 13:45:23,583 INFO L226 Difference]: Without dead ends: 402 [2025-02-08 13:45:23,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:45:23,584 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 106 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:23,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1407 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-08 13:45:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 399. [2025-02-08 13:45:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 389 states have (on average 1.437017994858612) internal successors, (559), 394 states have internal predecessors, (559), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 565 transitions. [2025-02-08 13:45:23,607 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 565 transitions. Word has length 79 [2025-02-08 13:45:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:23,607 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 565 transitions. [2025-02-08 13:45:23,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 13:45:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 565 transitions. [2025-02-08 13:45:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:45:23,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:23,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:23,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:45:23,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:23,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2115185943, now seen corresponding path program 1 times [2025-02-08 13:45:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819547439] [2025-02-08 13:45:23,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:23,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:23,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:45:23,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:45:23,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:23,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:23,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819547439] [2025-02-08 13:45:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819547439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878112685] [2025-02-08 13:45:23,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:23,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:45:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:23,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:45:23,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:45:23,785 INFO L87 Difference]: Start difference. First operand 399 states and 565 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 13:45:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:23,872 INFO L93 Difference]: Finished difference Result 797 states and 1132 transitions. [2025-02-08 13:45:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:45:23,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 13:45:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:23,874 INFO L225 Difference]: With dead ends: 797 [2025-02-08 13:45:23,874 INFO L226 Difference]: Without dead ends: 405 [2025-02-08 13:45:23,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 13:45:23,875 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:23,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1000 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-08 13:45:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-02-08 13:45:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 395 states have (on average 1.4303797468354431) internal successors, (565), 400 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 571 transitions. [2025-02-08 13:45:23,882 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 571 transitions. Word has length 79 [2025-02-08 13:45:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:23,882 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 571 transitions. [2025-02-08 13:45:23,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 13:45:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 571 transitions. [2025-02-08 13:45:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:45:23,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:23,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:45:23,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:23,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1346015928, now seen corresponding path program 1 times [2025-02-08 13:45:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221859757] [2025-02-08 13:45:23,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:23,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:45:23,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:45:23,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:23,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:24,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221859757] [2025-02-08 13:45:24,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221859757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:24,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:24,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138070130] [2025-02-08 13:45:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:24,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:45:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:24,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:45:24,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:45:24,008 INFO L87 Difference]: Start difference. First operand 405 states and 571 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 13:45:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:24,183 INFO L93 Difference]: Finished difference Result 1099 states and 1568 transitions. [2025-02-08 13:45:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:45:24,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 13:45:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:24,186 INFO L225 Difference]: With dead ends: 1099 [2025-02-08 13:45:24,186 INFO L226 Difference]: Without dead ends: 701 [2025-02-08 13:45:24,187 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 13:45:24,188 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 371 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:24,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1177 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:45:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-02-08 13:45:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 698. [2025-02-08 13:45:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 688 states have (on average 1.4462209302325582) internal successors, (995), 693 states have internal predecessors, (995), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1001 transitions. [2025-02-08 13:45:24,209 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1001 transitions. Word has length 79 [2025-02-08 13:45:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:24,209 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1001 transitions. [2025-02-08 13:45:24,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 13:45:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1001 transitions. [2025-02-08 13:45:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 13:45:24,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:24,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:24,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:45:24,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:24,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash 278947262, now seen corresponding path program 1 times [2025-02-08 13:45:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:24,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994021194] [2025-02-08 13:45:24,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:24,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 13:45:24,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 13:45:24,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:24,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:24,528 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 13:45:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994021194] [2025-02-08 13:45:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994021194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:24,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:24,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316551793] [2025-02-08 13:45:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:24,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:24,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:24,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:24,531 INFO L87 Difference]: Start difference. First operand 698 states and 1001 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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 13:45:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:24,714 INFO L93 Difference]: Finished difference Result 982 states and 1402 transitions. [2025-02-08 13:45:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:24,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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 94 [2025-02-08 13:45:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:24,718 INFO L225 Difference]: With dead ends: 982 [2025-02-08 13:45:24,718 INFO L226 Difference]: Without dead ends: 980 [2025-02-08 13:45:24,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:45:24,720 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 457 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:24,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1559 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:45:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-02-08 13:45:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 761. [2025-02-08 13:45:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 748 states have (on average 1.4331550802139037) internal successors, (1072), 753 states have internal predecessors, (1072), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1084 transitions. [2025-02-08 13:45:24,746 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1084 transitions. Word has length 94 [2025-02-08 13:45:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:24,747 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1084 transitions. [2025-02-08 13:45:24,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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 13:45:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1084 transitions. [2025-02-08 13:45:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 13:45:24,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:24,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:24,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:45:24,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:24,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1963969102, now seen corresponding path program 1 times [2025-02-08 13:45:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973532072] [2025-02-08 13:45:24,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:24,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:45:24,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:45:24,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:24,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:45:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973532072] [2025-02-08 13:45:25,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973532072] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338377092] [2025-02-08 13:45:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:25,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:25,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:25,144 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 13:45:25,147 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 13:45:25,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:45:25,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:45:25,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:25,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:25,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:45:25,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:25,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:45:25,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:45:25,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 13:45:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:26,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338377092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:26,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:45:26,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-02-08 13:45:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689029683] [2025-02-08 13:45:26,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:26,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:45:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:26,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:45:26,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:45:26,102 INFO L87 Difference]: Start difference. First operand 761 states and 1084 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 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 13:45:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:27,266 INFO L93 Difference]: Finished difference Result 1685 states and 2401 transitions. [2025-02-08 13:45:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:45:27,267 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 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 100 [2025-02-08 13:45:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:27,270 INFO L225 Difference]: With dead ends: 1685 [2025-02-08 13:45:27,270 INFO L226 Difference]: Without dead ends: 1016 [2025-02-08 13:45:27,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:45:27,272 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 806 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:27,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2487 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 13:45:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-02-08 13:45:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 792. [2025-02-08 13:45:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 779 states have (on average 1.422336328626444) internal successors, (1108), 784 states have internal predecessors, (1108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1120 transitions. [2025-02-08 13:45:27,291 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1120 transitions. Word has length 100 [2025-02-08 13:45:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:27,292 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1120 transitions. [2025-02-08 13:45:27,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 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 13:45:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1120 transitions. [2025-02-08 13:45:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 13:45:27,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:27,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:27,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:45:27,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:27,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:27,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1138097270, now seen corresponding path program 1 times [2025-02-08 13:45:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:27,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088237167] [2025-02-08 13:45:27,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:27,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:45:27,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:45:27,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:27,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:45:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088237167] [2025-02-08 13:45:27,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088237167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693540604] [2025-02-08 13:45:27,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:27,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:27,768 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 13:45:27,770 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 13:45:27,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:45:28,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:45:28,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:28,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 13:45:28,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:28,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693540604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:28,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:45:28,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 13:45:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680134360] [2025-02-08 13:45:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:28,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:45:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:28,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:45:28,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:45:28,332 INFO L87 Difference]: Start difference. First operand 792 states and 1120 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:45:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:28,867 INFO L93 Difference]: Finished difference Result 1518 states and 2156 transitions. [2025-02-08 13:45:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:45:28,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-02-08 13:45:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:28,871 INFO L225 Difference]: With dead ends: 1518 [2025-02-08 13:45:28,871 INFO L226 Difference]: Without dead ends: 849 [2025-02-08 13:45:28,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:45:28,873 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 15 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:28,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2453 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:45:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-02-08 13:45:28,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 841. [2025-02-08 13:45:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 828 states have (on average 1.4118357487922706) internal successors, (1169), 833 states have internal predecessors, (1169), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1181 transitions. [2025-02-08 13:45:28,891 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1181 transitions. Word has length 101 [2025-02-08 13:45:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:28,892 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1181 transitions. [2025-02-08 13:45:28,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:45:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1181 transitions. [2025-02-08 13:45:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 13:45:28,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:28,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:28,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:45:29,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:29,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:29,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1034550273, now seen corresponding path program 1 times [2025-02-08 13:45:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621547868] [2025-02-08 13:45:29,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:29,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:45:29,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:45:29,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:29,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:29,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621547868] [2025-02-08 13:45:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621547868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:45:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277422580] [2025-02-08 13:45:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:45:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:29,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:45:29,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:45:29,381 INFO L87 Difference]: Start difference. First operand 841 states and 1181 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 13:45:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:29,735 INFO L93 Difference]: Finished difference Result 1557 states and 2197 transitions. [2025-02-08 13:45:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:45:29,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-08 13:45:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:29,738 INFO L225 Difference]: With dead ends: 1557 [2025-02-08 13:45:29,738 INFO L226 Difference]: Without dead ends: 847 [2025-02-08 13:45:29,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:45:29,739 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 8 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:29,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1706 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:45:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-02-08 13:45:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-02-08 13:45:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 834 states have (on average 1.408872901678657) internal successors, (1175), 839 states have internal predecessors, (1175), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1187 transitions. [2025-02-08 13:45:29,759 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1187 transitions. Word has length 103 [2025-02-08 13:45:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:29,759 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1187 transitions. [2025-02-08 13:45:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 13:45:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1187 transitions. [2025-02-08 13:45:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 13:45:29,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:29,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:29,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:45:29,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:29,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1051027558, now seen corresponding path program 1 times [2025-02-08 13:45:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:29,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743013080] [2025-02-08 13:45:29,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:29,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:45:29,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:45:29,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:29,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:30,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743013080] [2025-02-08 13:45:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743013080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:30,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:30,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:45:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137344440] [2025-02-08 13:45:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:30,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:45:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:30,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:45:30,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:45:30,004 INFO L87 Difference]: Start difference. First operand 847 states and 1187 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 13:45:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:30,543 INFO L93 Difference]: Finished difference Result 1565 states and 2206 transitions. [2025-02-08 13:45:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:45:30,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-08 13:45:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:30,547 INFO L225 Difference]: With dead ends: 1565 [2025-02-08 13:45:30,547 INFO L226 Difference]: Without dead ends: 863 [2025-02-08 13:45:30,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:45:30,548 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 12 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2453 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:45:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-02-08 13:45:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 849. [2025-02-08 13:45:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 836 states have (on average 1.4102870813397128) internal successors, (1179), 841 states have internal predecessors, (1179), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1191 transitions. [2025-02-08 13:45:30,569 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1191 transitions. Word has length 103 [2025-02-08 13:45:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:30,569 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1191 transitions. [2025-02-08 13:45:30,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 13:45:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1191 transitions. [2025-02-08 13:45:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 13:45:30,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:30,570 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:30,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:45:30,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:30,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:30,571 INFO L85 PathProgramCache]: Analyzing trace with hash 49339748, now seen corresponding path program 1 times [2025-02-08 13:45:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:30,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944048131] [2025-02-08 13:45:30,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:30,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:45:30,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:45:30,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:30,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944048131] [2025-02-08 13:45:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944048131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 13:45:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785196360] [2025-02-08 13:45:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:30,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:45:30,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:30,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:45:30,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:45:30,839 INFO L87 Difference]: Start difference. First operand 849 states and 1191 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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 13:45:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:31,324 INFO L93 Difference]: Finished difference Result 1573 states and 2214 transitions. [2025-02-08 13:45:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:45:31,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-08 13:45:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:31,327 INFO L225 Difference]: With dead ends: 1573 [2025-02-08 13:45:31,327 INFO L226 Difference]: Without dead ends: 875 [2025-02-08 13:45:31,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:45:31,329 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 20 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:31,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2592 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:45:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-08 13:45:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 863. [2025-02-08 13:45:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 850 states have (on average 1.408235294117647) internal successors, (1197), 855 states have internal predecessors, (1197), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1209 transitions. [2025-02-08 13:45:31,344 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1209 transitions. Word has length 104 [2025-02-08 13:45:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:31,344 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1209 transitions. [2025-02-08 13:45:31,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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 13:45:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1209 transitions. [2025-02-08 13:45:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 13:45:31,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:31,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:31,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:45:31,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:31,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1015197416, now seen corresponding path program 1 times [2025-02-08 13:45:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:31,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404002903] [2025-02-08 13:45:31,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:31,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:45:31,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:45:31,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:45:31,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404002903] [2025-02-08 13:45:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404002903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847880136] [2025-02-08 13:45:31,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:31,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:31,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:31,565 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 13:45:31,567 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 13:45:31,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:45:31,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:45:31,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:31,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:31,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 13:45:31,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:31,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:31,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847880136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:31,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:45:31,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-02-08 13:45:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132802851] [2025-02-08 13:45:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:31,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:45:31,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:31,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:45:31,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:45:31,940 INFO L87 Difference]: Start difference. First operand 863 states and 1209 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 13:45:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:33,131 INFO L93 Difference]: Finished difference Result 1594 states and 2241 transitions. [2025-02-08 13:45:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 13:45:33,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-08 13:45:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:33,134 INFO L225 Difference]: With dead ends: 1594 [2025-02-08 13:45:33,134 INFO L226 Difference]: Without dead ends: 889 [2025-02-08 13:45:33,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:45:33,135 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 17 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:33,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2884 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 13:45:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-02-08 13:45:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 873. [2025-02-08 13:45:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 860 states have (on average 1.405813953488372) internal successors, (1209), 865 states have internal predecessors, (1209), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1221 transitions. [2025-02-08 13:45:33,153 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1221 transitions. Word has length 104 [2025-02-08 13:45:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:33,154 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1221 transitions. [2025-02-08 13:45:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 13:45:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1221 transitions. [2025-02-08 13:45:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 13:45:33,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:33,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:33,192 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 13:45:33,355 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,SelfDestructingSolverStorable12 [2025-02-08 13:45:33,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:33,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1111012863, now seen corresponding path program 1 times [2025-02-08 13:45:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15009420] [2025-02-08 13:45:33,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:33,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 13:45:33,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 13:45:33,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:33,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15009420] [2025-02-08 13:45:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15009420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 13:45:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098171247] [2025-02-08 13:45:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:33,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:45:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:33,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:45:33,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:45:33,631 INFO L87 Difference]: Start difference. First operand 873 states and 1221 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 13:45:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:34,225 INFO L93 Difference]: Finished difference Result 1606 states and 2257 transitions. [2025-02-08 13:45:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 13:45:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 105 [2025-02-08 13:45:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:34,228 INFO L225 Difference]: With dead ends: 1606 [2025-02-08 13:45:34,228 INFO L226 Difference]: Without dead ends: 891 [2025-02-08 13:45:34,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:45:34,230 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 26 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:34,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2933 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:45:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-02-08 13:45:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 879. [2025-02-08 13:45:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 866 states have (on average 1.4030023094688222) internal successors, (1215), 871 states have internal predecessors, (1215), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1227 transitions. [2025-02-08 13:45:34,246 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1227 transitions. Word has length 105 [2025-02-08 13:45:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:34,246 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1227 transitions. [2025-02-08 13:45:34,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 13:45:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1227 transitions. [2025-02-08 13:45:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 13:45:34,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:34,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:34,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:45:34,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:34,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:34,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1824868149, now seen corresponding path program 1 times [2025-02-08 13:45:34,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:34,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025911465] [2025-02-08 13:45:34,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:34,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:34,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 13:45:34,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 13:45:34,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:34,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:45:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025911465] [2025-02-08 13:45:34,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025911465] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925983970] [2025-02-08 13:45:34,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:34,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:34,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:34,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:45:34,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:45:34,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 13:45:35,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 13:45:35,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:35,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:35,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:45:35,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:35,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:35,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925983970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:35,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:45:35,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 13:45:35,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051847767] [2025-02-08 13:45:35,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:35,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:35,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:35,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:35,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:45:35,232 INFO L87 Difference]: Start difference. First operand 879 states and 1227 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:45:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:35,327 INFO L93 Difference]: Finished difference Result 1560 states and 2190 transitions. [2025-02-08 13:45:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-02-08 13:45:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:35,332 INFO L225 Difference]: With dead ends: 1560 [2025-02-08 13:45:35,332 INFO L226 Difference]: Without dead ends: 882 [2025-02-08 13:45:35,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:45:35,333 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 0 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:35,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1538 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-02-08 13:45:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2025-02-08 13:45:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 868 states have (on average 1.403225806451613) internal successors, (1218), 874 states have internal predecessors, (1218), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:45:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1232 transitions. [2025-02-08 13:45:35,349 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1232 transitions. Word has length 105 [2025-02-08 13:45:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:35,349 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1232 transitions. [2025-02-08 13:45:35,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:45:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1232 transitions. [2025-02-08 13:45:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 13:45:35,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:35,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:35,366 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 13:45:35,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 13:45:35,551 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:35,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1180378129, now seen corresponding path program 1 times [2025-02-08 13:45:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139303893] [2025-02-08 13:45:35,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:35,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 13:45:35,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 13:45:35,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:35,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:45:35,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139303893] [2025-02-08 13:45:35,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139303893] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:35,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074469141] [2025-02-08 13:45:35,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:35,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:35,833 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 13:45:35,834 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 13:45:36,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 13:45:36,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 13:45:36,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:36,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:36,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 13:45:36,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 13:45:36,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:36,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074469141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:36,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:45:36,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-02-08 13:45:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644432698] [2025-02-08 13:45:36,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:36,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:45:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:36,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:45:36,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:45:36,500 INFO L87 Difference]: Start difference. First operand 882 states and 1232 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 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 13:45:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:37,710 INFO L93 Difference]: Finished difference Result 1627 states and 2287 transitions. [2025-02-08 13:45:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 13:45:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 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 107 [2025-02-08 13:45:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:37,714 INFO L225 Difference]: With dead ends: 1627 [2025-02-08 13:45:37,714 INFO L226 Difference]: Without dead ends: 906 [2025-02-08 13:45:37,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:45:37,715 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 17 mSDsluCounter, 3187 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3693 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:37,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3693 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 13:45:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-02-08 13:45:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 896. [2025-02-08 13:45:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 882 states have (on average 1.401360544217687) internal successors, (1236), 888 states have internal predecessors, (1236), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:45:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1250 transitions. [2025-02-08 13:45:37,729 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1250 transitions. Word has length 107 [2025-02-08 13:45:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:37,729 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1250 transitions. [2025-02-08 13:45:37,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 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 13:45:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1250 transitions. [2025-02-08 13:45:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 13:45:37,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:37,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:37,741 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 13:45:37,931 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,SelfDestructingSolverStorable15 [2025-02-08 13:45:37,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:37,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1357459087, now seen corresponding path program 1 times [2025-02-08 13:45:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:37,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904593478] [2025-02-08 13:45:37,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:37,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 13:45:38,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 13:45:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:38,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:45:38,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:38,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904593478] [2025-02-08 13:45:38,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904593478] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:38,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94111874] [2025-02-08 13:45:38,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:38,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:38,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:38,170 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 13:45:38,172 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 13:45:38,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 13:45:38,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 13:45:38,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:38,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:38,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 13:45:38,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 13:45:38,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:38,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94111874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:38,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:45:38,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-02-08 13:45:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236074045] [2025-02-08 13:45:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:38,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:45:38,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:38,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:45:38,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 13:45:38,589 INFO L87 Difference]: Start difference. First operand 896 states and 1250 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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 13:45:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:39,115 INFO L93 Difference]: Finished difference Result 1637 states and 2295 transitions. [2025-02-08 13:45:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 13:45:39,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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 107 [2025-02-08 13:45:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:39,118 INFO L225 Difference]: With dead ends: 1637 [2025-02-08 13:45:39,118 INFO L226 Difference]: Without dead ends: 914 [2025-02-08 13:45:39,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 13:45:39,120 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 16 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:39,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2923 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:45:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-02-08 13:45:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 904. [2025-02-08 13:45:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 890 states have (on average 1.4) internal successors, (1246), 896 states have internal predecessors, (1246), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:45:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1260 transitions. [2025-02-08 13:45:39,134 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1260 transitions. Word has length 107 [2025-02-08 13:45:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:39,136 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1260 transitions. [2025-02-08 13:45:39,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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 13:45:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1260 transitions. [2025-02-08 13:45:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 13:45:39,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:39,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:39,145 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 13:45:39,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:39,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:39,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1449286189, now seen corresponding path program 1 times [2025-02-08 13:45:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:39,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180738501] [2025-02-08 13:45:39,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:39,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:39,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 13:45:39,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 13:45:39,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:39,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:45:39,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:39,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180738501] [2025-02-08 13:45:39,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180738501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:39,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782237839] [2025-02-08 13:45:39,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:39,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:39,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:39,577 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 13:45:39,579 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 13:45:39,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 13:45:39,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 13:45:39,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:39,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:39,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 13:45:39,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 13:45:40,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782237839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:40,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:45:40,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-02-08 13:45:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718993336] [2025-02-08 13:45:40,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:40,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:45:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:40,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:45:40,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:45:40,037 INFO L87 Difference]: Start difference. First operand 904 states and 1260 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 13:45:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:40,650 INFO L93 Difference]: Finished difference Result 1650 states and 2314 transitions. [2025-02-08 13:45:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:45:40,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 107 [2025-02-08 13:45:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:40,653 INFO L225 Difference]: With dead ends: 1650 [2025-02-08 13:45:40,653 INFO L226 Difference]: Without dead ends: 918 [2025-02-08 13:45:40,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:45:40,655 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 10 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:40,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2459 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:45:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-02-08 13:45:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 912. [2025-02-08 13:45:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 898 states have (on average 1.400890868596882) internal successors, (1258), 904 states have internal predecessors, (1258), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 13:45:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1272 transitions. [2025-02-08 13:45:40,667 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1272 transitions. Word has length 107 [2025-02-08 13:45:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:40,668 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1272 transitions. [2025-02-08 13:45:40,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 13:45:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1272 transitions. [2025-02-08 13:45:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 13:45:40,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:40,669 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:40,679 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 13:45:40,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 13:45:40,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash 910167233, now seen corresponding path program 1 times [2025-02-08 13:45:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536138374] [2025-02-08 13:45:40,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:40,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:45:40,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:45:40,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:40,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:45:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:41,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536138374] [2025-02-08 13:45:41,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536138374] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:41,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737550569] [2025-02-08 13:45:41,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:41,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:41,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:41,078 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 13:45:41,078 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 13:45:41,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:45:41,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:45:41,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:41,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:41,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-02-08 13:45:41,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:41,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 13:45:42,130 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-08 13:45:42,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-08 13:45:42,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 13:45:42,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 13:45:42,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-08 13:45:42,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 13:45:42,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2025-02-08 13:45:42,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22