./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-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 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:19:57,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:19:57,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:19:57,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:19:57,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:19:57,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:19:57,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:19:57,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:19:57,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:19:57,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:19:57,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:19:57,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:19:57,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:19:57,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:19:57,316 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:19:57,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:19:57,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:19:57,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:19:57,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:19:57,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:19:57,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:19:57,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:19:57,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:19:57,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:19:57,318 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:19:57,318 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:19:57,318 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:19:57,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:19:57,319 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:19:57,319 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:19:57,319 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:19:57,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:19:57,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:19:57,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:19:57,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:19:57,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:19:57,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:19:57,320 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:19:57,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:19:57,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:19:57,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:19:57,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:19:57,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:19:57,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:19:57,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:19:57,321 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 -> 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 [2025-02-06 18:19:57,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:19:57,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:19:57,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:19:57,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:19:57,618 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:19:57,620 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_test5-1.i [2025-02-06 18:19:58,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4aa08c33c/9ac6137094354c45985a718743577096/FLAG3c98d3bfc [2025-02-06 18:19:59,291 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:19:59,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2025-02-06 18:19:59,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4aa08c33c/9ac6137094354c45985a718743577096/FLAG3c98d3bfc [2025-02-06 18:19:59,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4aa08c33c/9ac6137094354c45985a718743577096 [2025-02-06 18:19:59,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:19:59,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:19:59,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:19:59,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:19:59,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:19:59,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:19:59" (1/1) ... [2025-02-06 18:19:59,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7b30ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:59, skipping insertion in model container [2025-02-06 18:19:59,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:19:59" (1/1) ... [2025-02-06 18:19:59,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:19:59,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:19:59,944 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:20:00,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:20:00,090 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:20:00,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00 WrapperNode [2025-02-06 18:20:00,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:20:00,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:20:00,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:20:00,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:20:00,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,198 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1984 [2025-02-06 18:20:00,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:20:00,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:20:00,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:20:00,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:20:00,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,344 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-02-06 18:20:00,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:20:00,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:20:00,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:20:00,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:20:00,460 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (1/1) ... [2025-02-06 18:20:00,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:20:00,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:00,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:20:00,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:20:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 18:20:00,521 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 18:20:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:20:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:20:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:20:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 18:20:00,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 18:20:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:20:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:20:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:20:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:20:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:20:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:20:00,523 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:20:00,523 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:20:00,523 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:20:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:20:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:20:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:20:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:20:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:20:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:20:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:20:00,756 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:20:00,758 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:20:02,436 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-02-06 18:20:02,579 INFO L? ?]: Removed 491 outVars from TransFormulas that were not future-live. [2025-02-06 18:20:02,579 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:20:02,652 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:20:02,652 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 18:20:02,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:20:02 BoogieIcfgContainer [2025-02-06 18:20:02,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:20:02,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:20:02,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:20:02,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:20:02,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:19:59" (1/3) ... [2025-02-06 18:20:02,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1c7273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:20:02, skipping insertion in model container [2025-02-06 18:20:02,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:20:00" (2/3) ... [2025-02-06 18:20:02,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1c7273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:20:02, skipping insertion in model container [2025-02-06 18:20:02,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:20:02" (3/3) ... [2025-02-06 18:20:02,667 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-1.i [2025-02-06 18:20:02,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:20:02,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test5-1.i that has 6 procedures, 590 locations, 1 initial locations, 49 loop locations, and 10 error locations. [2025-02-06 18:20:02,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:20:02,776 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;@6a8622ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:20:02,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 18:20:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 582 states, 555 states have (on average 1.6234234234234235) internal successors, (901), 572 states have internal predecessors, (901), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:20:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 18:20:02,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:02,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:20:02,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash 979379081, now seen corresponding path program 1 times [2025-02-06 18:20:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:02,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898818139] [2025-02-06 18:20:02,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:02,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:20:02,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:20:02,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:02,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:20:02,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:02,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898818139] [2025-02-06 18:20:02,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898818139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:02,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:20:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248752927] [2025-02-06 18:20:02,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:02,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:20:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:02,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:20:02,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:20:02,968 INFO L87 Difference]: Start difference. First operand has 582 states, 555 states have (on average 1.6234234234234235) internal successors, (901), 572 states have internal predecessors, (901), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:20:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:03,155 INFO L93 Difference]: Finished difference Result 1158 states and 1856 transitions. [2025-02-06 18:20:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:20:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-02-06 18:20:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:03,172 INFO L225 Difference]: With dead ends: 1158 [2025-02-06 18:20:03,173 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 18:20:03,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:20:03,179 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:03,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:20:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 18:20:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-06 18:20:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 551 states have (on average 1.4682395644283122) internal successors, (809), 563 states have internal predecessors, (809), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 18:20:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 831 transitions. [2025-02-06 18:20:03,251 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 831 transitions. Word has length 5 [2025-02-06 18:20:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:03,251 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 831 transitions. [2025-02-06 18:20:03,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:20:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 831 transitions. [2025-02-06 18:20:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 18:20:03,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:03,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:20:03,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:20:03,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:03,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash 295980734, now seen corresponding path program 1 times [2025-02-06 18:20:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:03,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224772596] [2025-02-06 18:20:03,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:03,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:20:03,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:20:03,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:03,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:20:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:03,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224772596] [2025-02-06 18:20:03,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224772596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:03,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:20:03,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621635960] [2025-02-06 18:20:03,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:03,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:20:03,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:03,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:20:03,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:20:03,351 INFO L87 Difference]: Start difference. First operand 572 states and 831 transitions. Second operand has 3 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-06 18:20:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:03,623 INFO L93 Difference]: Finished difference Result 1306 states and 1912 transitions. [2025-02-06 18:20:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:20:03,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-06 18:20:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:03,633 INFO L225 Difference]: With dead ends: 1306 [2025-02-06 18:20:03,633 INFO L226 Difference]: Without dead ends: 1126 [2025-02-06 18:20:03,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:20:03,635 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 789 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:03,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1511 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:20:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-02-06 18:20:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 747. [2025-02-06 18:20:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 721 states have (on average 1.4715672676837726) internal successors, (1061), 738 states have internal predecessors, (1061), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 18:20:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1093 transitions. [2025-02-06 18:20:03,703 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1093 transitions. Word has length 6 [2025-02-06 18:20:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:03,704 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1093 transitions. [2025-02-06 18:20:03,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-06 18:20:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1093 transitions. [2025-02-06 18:20:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 18:20:03,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:03,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:03,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:20:03,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1829302334, now seen corresponding path program 1 times [2025-02-06 18:20:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:03,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60004291] [2025-02-06 18:20:03,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:03,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 18:20:03,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 18:20:03,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:03,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:20:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:04,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60004291] [2025-02-06 18:20:04,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60004291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:04,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:20:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057392026] [2025-02-06 18:20:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:04,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:20:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:04,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:20:04,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:20:04,392 INFO L87 Difference]: Start difference. First operand 747 states and 1093 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:20:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:04,628 INFO L93 Difference]: Finished difference Result 1490 states and 2182 transitions. [2025-02-06 18:20:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:20:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 149 [2025-02-06 18:20:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:04,634 INFO L225 Difference]: With dead ends: 1490 [2025-02-06 18:20:04,634 INFO L226 Difference]: Without dead ends: 750 [2025-02-06 18:20:04,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:20:04,636 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 105 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:04,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2139 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:20:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-02-06 18:20:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 747. [2025-02-06 18:20:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 721 states have (on average 1.4618585298196949) internal successors, (1054), 738 states have internal predecessors, (1054), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 18:20:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1086 transitions. [2025-02-06 18:20:04,658 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1086 transitions. Word has length 149 [2025-02-06 18:20:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:04,658 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1086 transitions. [2025-02-06 18:20:04,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:20:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1086 transitions. [2025-02-06 18:20:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 18:20:04,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:04,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:04,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:20:04,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:04,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 772722267, now seen corresponding path program 1 times [2025-02-06 18:20:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:04,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601175703] [2025-02-06 18:20:04,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 18:20:04,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 18:20:04,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:04,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:04,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-06 18:20:04,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:04,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601175703] [2025-02-06 18:20:04,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601175703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:04,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:04,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:20:04,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936284447] [2025-02-06 18:20:04,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:04,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:20:04,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:04,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:20:04,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:20:04,946 INFO L87 Difference]: Start difference. First operand 747 states and 1086 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:20:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:05,131 INFO L93 Difference]: Finished difference Result 1613 states and 2351 transitions. [2025-02-06 18:20:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:20:05,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2025-02-06 18:20:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:05,137 INFO L225 Difference]: With dead ends: 1613 [2025-02-06 18:20:05,137 INFO L226 Difference]: Without dead ends: 873 [2025-02-06 18:20:05,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:20:05,140 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 134 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:05,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1513 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:20:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-06 18:20:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-06 18:20:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 847 states have (on average 1.462809917355372) internal successors, (1239), 864 states have internal predecessors, (1239), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 18:20:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1271 transitions. [2025-02-06 18:20:05,165 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1271 transitions. Word has length 149 [2025-02-06 18:20:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:05,166 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1271 transitions. [2025-02-06 18:20:05,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:20:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1271 transitions. [2025-02-06 18:20:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 18:20:05,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:05,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:05,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:20:05,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:05,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash -568937964, now seen corresponding path program 1 times [2025-02-06 18:20:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:05,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003074653] [2025-02-06 18:20:05,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:05,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:05,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 18:20:05,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 18:20:05,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:05,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:20:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:05,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003074653] [2025-02-06 18:20:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003074653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:05,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:20:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801192906] [2025-02-06 18:20:05,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:05,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:20:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:05,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:20:05,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:20:05,592 INFO L87 Difference]: Start difference. First operand 873 states and 1271 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:20:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:05,820 INFO L93 Difference]: Finished difference Result 1616 states and 2353 transitions. [2025-02-06 18:20:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:20:05,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 164 [2025-02-06 18:20:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:05,825 INFO L225 Difference]: With dead ends: 1616 [2025-02-06 18:20:05,825 INFO L226 Difference]: Without dead ends: 876 [2025-02-06 18:20:05,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:20:05,828 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 105 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:05,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2118 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:20:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-02-06 18:20:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 873. [2025-02-06 18:20:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 847 states have (on average 1.4545454545454546) internal successors, (1232), 864 states have internal predecessors, (1232), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 18:20:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1264 transitions. [2025-02-06 18:20:05,861 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1264 transitions. Word has length 164 [2025-02-06 18:20:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:05,862 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1264 transitions. [2025-02-06 18:20:05,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:20:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1264 transitions. [2025-02-06 18:20:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 18:20:05,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:05,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:05,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:20:05,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:05,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1954881683, now seen corresponding path program 1 times [2025-02-06 18:20:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:05,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450757184] [2025-02-06 18:20:05,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:05,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 18:20:05,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 18:20:05,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:05,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:20:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450757184] [2025-02-06 18:20:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450757184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:06,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:20:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096182137] [2025-02-06 18:20:06,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:20:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:20:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:20:06,187 INFO L87 Difference]: Start difference. First operand 873 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:20:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:06,430 INFO L93 Difference]: Finished difference Result 1973 states and 2865 transitions. [2025-02-06 18:20:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:20:06,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 164 [2025-02-06 18:20:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:06,438 INFO L225 Difference]: With dead ends: 1973 [2025-02-06 18:20:06,438 INFO L226 Difference]: Without dead ends: 1233 [2025-02-06 18:20:06,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:20:06,441 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 537 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:06,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1671 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:20:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-02-06 18:20:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1228. [2025-02-06 18:20:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1189 states have (on average 1.4575273338940287) internal successors, (1733), 1216 states have internal predecessors, (1733), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 18:20:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1791 transitions. [2025-02-06 18:20:06,484 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1791 transitions. Word has length 164 [2025-02-06 18:20:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:06,485 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1791 transitions. [2025-02-06 18:20:06,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:20:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1791 transitions. [2025-02-06 18:20:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-06 18:20:06,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:06,487 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:06,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:20:06,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:06,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1713324440, now seen corresponding path program 1 times [2025-02-06 18:20:06,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:06,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178835397] [2025-02-06 18:20:06,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:06,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 18:20:06,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 18:20:06,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:06,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:06,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178835397] [2025-02-06 18:20:06,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178835397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:20:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86290850] [2025-02-06 18:20:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:20:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:06,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:20:06,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:20:06,886 INFO L87 Difference]: Start difference. First operand 1228 states and 1791 transitions. Second operand has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:07,131 INFO L93 Difference]: Finished difference Result 1295 states and 1876 transitions. [2025-02-06 18:20:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:20:07,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 179 [2025-02-06 18:20:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:07,138 INFO L225 Difference]: With dead ends: 1295 [2025-02-06 18:20:07,138 INFO L226 Difference]: Without dead ends: 1293 [2025-02-06 18:20:07,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:20:07,139 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 615 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:07,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 2301 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:20:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-02-06 18:20:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1291. [2025-02-06 18:20:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1249 states have (on average 1.4491593274619696) internal successors, (1810), 1276 states have internal predecessors, (1810), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1874 transitions. [2025-02-06 18:20:07,176 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1874 transitions. Word has length 179 [2025-02-06 18:20:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:07,177 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1874 transitions. [2025-02-06 18:20:07,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1874 transitions. [2025-02-06 18:20:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-06 18:20:07,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:07,179 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:07,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:20:07,180 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:07,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 690209996, now seen corresponding path program 1 times [2025-02-06 18:20:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:07,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318175134] [2025-02-06 18:20:07,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:07,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:07,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 18:20:08,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 18:20:08,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:08,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:20:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318175134] [2025-02-06 18:20:08,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318175134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:20:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23067612] [2025-02-06 18:20:08,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:08,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:08,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:08,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:20:08,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:20:08,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 18:20:09,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 18:20:09,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:09,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:09,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 18:20:09,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:20:09,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:20:09,105 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 27 treesize of output 11 [2025-02-06 18:20:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:09,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:20:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23067612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:20:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:20:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957694471] [2025-02-06 18:20:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:20:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:09,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:20:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:20:09,896 INFO L87 Difference]: Start difference. First operand 1291 states and 1874 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:13,040 INFO L93 Difference]: Finished difference Result 2546 states and 3689 transitions. [2025-02-06 18:20:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:20:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-02-06 18:20:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:13,047 INFO L225 Difference]: With dead ends: 2546 [2025-02-06 18:20:13,047 INFO L226 Difference]: Without dead ends: 1341 [2025-02-06 18:20:13,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:20:13,050 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1043 mSDsluCounter, 4816 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 5562 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:13,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 5562 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 18:20:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-02-06 18:20:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1316. [2025-02-06 18:20:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1274 states have (on average 1.444270015698587) internal successors, (1840), 1301 states have internal predecessors, (1840), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1904 transitions. [2025-02-06 18:20:13,088 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1904 transitions. Word has length 185 [2025-02-06 18:20:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:13,088 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1904 transitions. [2025-02-06 18:20:13,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1904 transitions. [2025-02-06 18:20:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-06 18:20:13,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:13,091 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:13,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:20:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:13,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash -650760765, now seen corresponding path program 1 times [2025-02-06 18:20:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385760307] [2025-02-06 18:20:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:13,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 18:20:13,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 18:20:13,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:13,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:20:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:14,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385760307] [2025-02-06 18:20:14,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385760307] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:20:14,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711495175] [2025-02-06 18:20:14,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:14,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:14,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:20:14,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:20:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 18:20:14,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 18:20:14,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:14,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:14,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 18:20:14,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:20:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:14,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:20:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711495175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:20:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 18:20:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228558649] [2025-02-06 18:20:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:14,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:20:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:14,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:20:14,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:20:14,638 INFO L87 Difference]: Start difference. First operand 1316 states and 1904 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:14,967 INFO L93 Difference]: Finished difference Result 2564 states and 3716 transitions. [2025-02-06 18:20:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:20:14,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-02-06 18:20:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:14,974 INFO L225 Difference]: With dead ends: 2564 [2025-02-06 18:20:14,974 INFO L226 Difference]: Without dead ends: 1359 [2025-02-06 18:20:14,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:20:14,977 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 17 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:14,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2072 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:20:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-02-06 18:20:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1343. [2025-02-06 18:20:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1301 states have (on average 1.4396617986164488) internal successors, (1873), 1328 states have internal predecessors, (1873), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1937 transitions. [2025-02-06 18:20:15,014 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1937 transitions. Word has length 186 [2025-02-06 18:20:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:15,015 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1937 transitions. [2025-02-06 18:20:15,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1937 transitions. [2025-02-06 18:20:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 18:20:15,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:15,017 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:15,029 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-06 18:20:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:15,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:15,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -442224849, now seen corresponding path program 1 times [2025-02-06 18:20:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694162475] [2025-02-06 18:20:15,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:15,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 18:20:15,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 18:20:15,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:15,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:15,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694162475] [2025-02-06 18:20:15,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694162475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:15,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:15,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:20:15,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857445812] [2025-02-06 18:20:15,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:15,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:20:15,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:15,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:20:15,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:20:15,705 INFO L87 Difference]: Start difference. First operand 1343 states and 1937 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:16,244 INFO L93 Difference]: Finished difference Result 2583 states and 3735 transitions. [2025-02-06 18:20:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:20:16,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-02-06 18:20:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:16,251 INFO L225 Difference]: With dead ends: 2583 [2025-02-06 18:20:16,251 INFO L226 Difference]: Without dead ends: 1355 [2025-02-06 18:20:16,253 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-06 18:20:16,253 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 8 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:16,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2654 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 18:20:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-02-06 18:20:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1351. [2025-02-06 18:20:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1309 states have (on average 1.4385026737967914) internal successors, (1883), 1336 states have internal predecessors, (1883), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1947 transitions. [2025-02-06 18:20:16,292 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1947 transitions. Word has length 187 [2025-02-06 18:20:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:16,292 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1947 transitions. [2025-02-06 18:20:16,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1947 transitions. [2025-02-06 18:20:16,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-06 18:20:16,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:16,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:16,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:20:16,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1918681095, now seen corresponding path program 1 times [2025-02-06 18:20:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:16,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169731420] [2025-02-06 18:20:16,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:16,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 18:20:16,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 18:20:16,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:16,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:16,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:16,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169731420] [2025-02-06 18:20:16,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169731420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:16,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:16,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:20:16,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697677142] [2025-02-06 18:20:16,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:16,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:20:16,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:16,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:20:16,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:20:16,755 INFO L87 Difference]: Start difference. First operand 1351 states and 1947 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:17,530 INFO L93 Difference]: Finished difference Result 2598 states and 3755 transitions. [2025-02-06 18:20:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:20:17,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-02-06 18:20:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:17,537 INFO L225 Difference]: With dead ends: 2598 [2025-02-06 18:20:17,537 INFO L226 Difference]: Without dead ends: 1373 [2025-02-06 18:20:17,539 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-06 18:20:17,540 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 12 mSDsluCounter, 3138 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:17,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3875 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 18:20:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-02-06 18:20:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1367. [2025-02-06 18:20:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1325 states have (on average 1.4377358490566037) internal successors, (1905), 1352 states have internal predecessors, (1905), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1969 transitions. [2025-02-06 18:20:17,581 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1969 transitions. Word has length 188 [2025-02-06 18:20:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:17,581 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1969 transitions. [2025-02-06 18:20:17,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1969 transitions. [2025-02-06 18:20:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-06 18:20:17,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:17,583 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:17,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:20:17,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:17,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash -135908535, now seen corresponding path program 1 times [2025-02-06 18:20:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:17,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3871619] [2025-02-06 18:20:17,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:17,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 18:20:18,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 18:20:18,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:18,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:20:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3871619] [2025-02-06 18:20:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3871619] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:20:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472697191] [2025-02-06 18:20:18,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:18,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:18,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:18,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:20:18,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:20:18,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 18:20:19,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 18:20:19,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:19,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:19,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 18:20:19,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:20:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 18:20:19,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:20:19,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472697191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:19,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:20:19,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2025-02-06 18:20:19,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985058838] [2025-02-06 18:20:19,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:19,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 18:20:19,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:19,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 18:20:19,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:20:19,172 INFO L87 Difference]: Start difference. First operand 1367 states and 1969 transitions. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:19,758 INFO L93 Difference]: Finished difference Result 2514 states and 3629 transitions. [2025-02-06 18:20:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:20:19,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2025-02-06 18:20:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:19,765 INFO L225 Difference]: With dead ends: 2514 [2025-02-06 18:20:19,765 INFO L226 Difference]: Without dead ends: 1457 [2025-02-06 18:20:19,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:20:19,767 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 30 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:19,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3411 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 18:20:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-02-06 18:20:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1433. [2025-02-06 18:20:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1391 states have (on average 1.428468727534148) internal successors, (1987), 1418 states have internal predecessors, (1987), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2051 transitions. [2025-02-06 18:20:19,802 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2051 transitions. Word has length 188 [2025-02-06 18:20:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:19,802 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2051 transitions. [2025-02-06 18:20:19,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2051 transitions. [2025-02-06 18:20:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-06 18:20:19,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:19,805 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:19,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:20:20,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:20,006 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:20,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash -978505704, now seen corresponding path program 1 times [2025-02-06 18:20:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157574296] [2025-02-06 18:20:20,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:20,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-06 18:20:20,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-06 18:20:20,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:20,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:20,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157574296] [2025-02-06 18:20:20,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157574296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:20,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:20,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:20:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037456632] [2025-02-06 18:20:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:20:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:20,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:20:20,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:20:20,512 INFO L87 Difference]: Start difference. First operand 1433 states and 2051 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:21,170 INFO L93 Difference]: Finished difference Result 2524 states and 3629 transitions. [2025-02-06 18:20:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:20:21,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2025-02-06 18:20:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:21,177 INFO L225 Difference]: With dead ends: 2524 [2025-02-06 18:20:21,177 INFO L226 Difference]: Without dead ends: 1435 [2025-02-06 18:20:21,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:20:21,180 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 13 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3228 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:21,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3228 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 18:20:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-02-06 18:20:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1427. [2025-02-06 18:20:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1385 states have (on average 1.4274368231046932) internal successors, (1977), 1412 states have internal predecessors, (1977), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2041 transitions. [2025-02-06 18:20:21,211 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2041 transitions. Word has length 189 [2025-02-06 18:20:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:21,212 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 2041 transitions. [2025-02-06 18:20:21,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2041 transitions. [2025-02-06 18:20:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 18:20:21,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:21,214 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:21,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:20:21,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:21,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1369718906, now seen corresponding path program 1 times [2025-02-06 18:20:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:21,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193698884] [2025-02-06 18:20:21,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:21,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 18:20:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 18:20:21,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:21,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:21,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193698884] [2025-02-06 18:20:21,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193698884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:21,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:21,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:20:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072263623] [2025-02-06 18:20:21,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:21,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:20:21,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:21,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:20:21,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:20:21,623 INFO L87 Difference]: Start difference. First operand 1427 states and 2041 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:22,109 INFO L93 Difference]: Finished difference Result 2523 states and 3626 transitions. [2025-02-06 18:20:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:20:22,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 190 [2025-02-06 18:20:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:22,115 INFO L225 Difference]: With dead ends: 2523 [2025-02-06 18:20:22,115 INFO L226 Difference]: Without dead ends: 1439 [2025-02-06 18:20:22,117 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-06 18:20:22,118 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 8 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:22,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2654 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 18:20:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-02-06 18:20:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1435. [2025-02-06 18:20:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1393 states have (on average 1.4264178033022255) internal successors, (1987), 1420 states have internal predecessors, (1987), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2051 transitions. [2025-02-06 18:20:22,148 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2051 transitions. Word has length 190 [2025-02-06 18:20:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:22,148 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 2051 transitions. [2025-02-06 18:20:22,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2051 transitions. [2025-02-06 18:20:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 18:20:22,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:22,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:22,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:20:22,151 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:22,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash -42807404, now seen corresponding path program 1 times [2025-02-06 18:20:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4683992] [2025-02-06 18:20:22,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:22,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 18:20:22,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 18:20:22,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:22,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:20:22,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:22,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4683992] [2025-02-06 18:20:22,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4683992] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:20:22,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930076426] [2025-02-06 18:20:22,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:22,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:22,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:22,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:20:22,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:20:23,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 18:20:23,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 18:20:23,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:23,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:23,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 18:20:23,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:20:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:27,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:20:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930076426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:27,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:20:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 18:20:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854679362] [2025-02-06 18:20:27,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:27,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:20:27,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:27,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:20:27,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:20:27,937 INFO L87 Difference]: Start difference. First operand 1435 states and 2051 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:28,755 INFO L93 Difference]: Finished difference Result 2750 states and 3940 transitions. [2025-02-06 18:20:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:20:28,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2025-02-06 18:20:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:28,761 INFO L225 Difference]: With dead ends: 2750 [2025-02-06 18:20:28,761 INFO L226 Difference]: Without dead ends: 1449 [2025-02-06 18:20:28,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 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-06 18:20:28,764 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 12 mSDsluCounter, 3139 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:28,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3881 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 18:20:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-02-06 18:20:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1435. [2025-02-06 18:20:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1393 states have (on average 1.4264178033022255) internal successors, (1987), 1420 states have internal predecessors, (1987), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2051 transitions. [2025-02-06 18:20:28,793 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2051 transitions. Word has length 191 [2025-02-06 18:20:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:28,793 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 2051 transitions. [2025-02-06 18:20:28,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2051 transitions. [2025-02-06 18:20:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 18:20:28,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:28,796 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:28,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 18:20:28,996 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,SelfDestructingSolverStorable14 [2025-02-06 18:20:28,997 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:28,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2124930951, now seen corresponding path program 1 times [2025-02-06 18:20:29,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:29,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827569557] [2025-02-06 18:20:29,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:29,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:29,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 18:20:29,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 18:20:29,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:29,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:29,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827569557] [2025-02-06 18:20:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827569557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:29,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 18:20:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149912158] [2025-02-06 18:20:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:29,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 18:20:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:29,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 18:20:29,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:20:29,487 INFO L87 Difference]: Start difference. First operand 1435 states and 2051 transitions. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:30,322 INFO L93 Difference]: Finished difference Result 2757 states and 3946 transitions. [2025-02-06 18:20:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:20:30,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2025-02-06 18:20:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:30,328 INFO L225 Difference]: With dead ends: 2757 [2025-02-06 18:20:30,328 INFO L226 Difference]: Without dead ends: 1461 [2025-02-06 18:20:30,329 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-06 18:20:30,330 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 20 mSDsluCounter, 4503 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5240 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:30,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 5240 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 18:20:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2025-02-06 18:20:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1449. [2025-02-06 18:20:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1407 states have (on average 1.4250177683013503) internal successors, (2005), 1434 states have internal predecessors, (2005), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2069 transitions. [2025-02-06 18:20:30,357 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2069 transitions. Word has length 192 [2025-02-06 18:20:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:30,357 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 2069 transitions. [2025-02-06 18:20:30,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2069 transitions. [2025-02-06 18:20:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 18:20:30,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:30,359 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:30,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:20:30,360 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:30,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1877074377, now seen corresponding path program 1 times [2025-02-06 18:20:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:30,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383400883] [2025-02-06 18:20:30,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:30,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 18:20:30,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 18:20:30,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:30,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:20:31,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:31,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383400883] [2025-02-06 18:20:31,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383400883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:20:31,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47545428] [2025-02-06 18:20:31,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:31,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:31,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:31,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:20:31,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:20:31,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 18:20:31,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 18:20:31,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:31,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:31,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 18:20:31,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:20:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:32,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:20:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47545428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:20:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-02-06 18:20:32,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447725529] [2025-02-06 18:20:32,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:32,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:20:32,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:32,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:20:32,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:20:32,007 INFO L87 Difference]: Start difference. First operand 1449 states and 2069 transitions. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:32,840 INFO L93 Difference]: Finished difference Result 2778 states and 3973 transitions. [2025-02-06 18:20:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:20:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2025-02-06 18:20:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:32,847 INFO L225 Difference]: With dead ends: 2778 [2025-02-06 18:20:32,847 INFO L226 Difference]: Without dead ends: 1475 [2025-02-06 18:20:32,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 187 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-06 18:20:32,849 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 17 mSDsluCounter, 3798 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:32,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4543 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 18:20:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2025-02-06 18:20:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1459. [2025-02-06 18:20:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1417 states have (on average 1.4234297812279464) internal successors, (2017), 1444 states have internal predecessors, (2017), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2081 transitions. [2025-02-06 18:20:32,884 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2081 transitions. Word has length 192 [2025-02-06 18:20:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:32,884 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2081 transitions. [2025-02-06 18:20:32,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2081 transitions. [2025-02-06 18:20:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 18:20:32,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:32,887 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:32,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 18:20:33,087 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,SelfDestructingSolverStorable16 [2025-02-06 18:20:33,088 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash 187333391, now seen corresponding path program 1 times [2025-02-06 18:20:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:33,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200941211] [2025-02-06 18:20:33,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:33,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 18:20:33,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 18:20:33,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:33,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200941211] [2025-02-06 18:20:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200941211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:33,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:33,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 18:20:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898845859] [2025-02-06 18:20:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:33,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:20:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:33,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:20:33,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:20:33,719 INFO L87 Difference]: Start difference. First operand 1459 states and 2081 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:34,520 INFO L93 Difference]: Finished difference Result 2790 states and 3989 transitions. [2025-02-06 18:20:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:20:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2025-02-06 18:20:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:34,526 INFO L225 Difference]: With dead ends: 2790 [2025-02-06 18:20:34,526 INFO L226 Difference]: Without dead ends: 1477 [2025-02-06 18:20:34,528 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-06 18:20:34,528 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 23 mSDsluCounter, 4479 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5222 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:34,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5222 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 18:20:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2025-02-06 18:20:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1465. [2025-02-06 18:20:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1423 states have (on average 1.421644413211525) internal successors, (2023), 1450 states have internal predecessors, (2023), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2087 transitions. [2025-02-06 18:20:34,552 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2087 transitions. Word has length 193 [2025-02-06 18:20:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:34,552 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 2087 transitions. [2025-02-06 18:20:34,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:20:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2087 transitions. [2025-02-06 18:20:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 18:20:34,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:34,554 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:34,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:20:34,555 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:34,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash 603990001, now seen corresponding path program 1 times [2025-02-06 18:20:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870592254] [2025-02-06 18:20:34,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:34,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 18:20:35,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 18:20:35,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:35,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:20:35,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:35,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870592254] [2025-02-06 18:20:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870592254] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:20:35,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363105668] [2025-02-06 18:20:35,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:35,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:35,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:35,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:20:35,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:20:35,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 18:20:36,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 18:20:36,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:36,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:36,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 18:20:36,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:20:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 18:20:44,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:20:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363105668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:20:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 18:20:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400925419] [2025-02-06 18:20:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:20:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:44,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:20:44,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:20:44,435 INFO L87 Difference]: Start difference. First operand 1465 states and 2087 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:46,611 INFO L93 Difference]: Finished difference Result 2583 states and 3700 transitions. [2025-02-06 18:20:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:20:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2025-02-06 18:20:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:46,617 INFO L225 Difference]: With dead ends: 2583 [2025-02-06 18:20:46,617 INFO L226 Difference]: Without dead ends: 1487 [2025-02-06 18:20:46,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:20:46,619 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 12 mSDsluCounter, 3138 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3874 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:46,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3874 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 18:20:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2025-02-06 18:20:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1479. [2025-02-06 18:20:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1437 states have (on average 1.420320111343076) internal successors, (2041), 1464 states have internal predecessors, (2041), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2105 transitions. [2025-02-06 18:20:46,644 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2105 transitions. Word has length 193 [2025-02-06 18:20:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:46,645 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2105 transitions. [2025-02-06 18:20:46,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2105 transitions. [2025-02-06 18:20:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 18:20:46,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:46,647 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:46,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:20:46,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:46,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:46,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2134513601, now seen corresponding path program 1 times [2025-02-06 18:20:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021840317] [2025-02-06 18:20:46,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:46,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 18:20:46,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 18:20:46,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:46,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:20:47,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:47,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021840317] [2025-02-06 18:20:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021840317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:47,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:20:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:20:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153843957] [2025-02-06 18:20:47,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:20:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:47,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:20:47,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:20:47,275 INFO L87 Difference]: Start difference. First operand 1479 states and 2105 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:47,899 INFO L93 Difference]: Finished difference Result 2598 states and 3719 transitions. [2025-02-06 18:20:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:20:47,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2025-02-06 18:20:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:47,905 INFO L225 Difference]: With dead ends: 2598 [2025-02-06 18:20:47,905 INFO L226 Difference]: Without dead ends: 1495 [2025-02-06 18:20:47,907 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-06 18:20:47,907 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 12 mSDsluCounter, 3139 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:47,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3880 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 18:20:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2025-02-06 18:20:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1481. [2025-02-06 18:20:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1439 states have (on average 1.4211257817929117) internal successors, (2045), 1466 states have internal predecessors, (2045), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 18:20:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2109 transitions. [2025-02-06 18:20:47,930 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2109 transitions. Word has length 193 [2025-02-06 18:20:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:47,930 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 2109 transitions. [2025-02-06 18:20:47,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2109 transitions. [2025-02-06 18:20:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 18:20:47,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:47,932 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:47,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:20:47,932 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash -618249054, now seen corresponding path program 1 times [2025-02-06 18:20:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:47,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91400167] [2025-02-06 18:20:47,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:48,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 18:20:48,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 18:20:48,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:48,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:20:48,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:48,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91400167] [2025-02-06 18:20:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91400167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:20:48,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969781658] [2025-02-06 18:20:48,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:48,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:48,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:48,607 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:20:48,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:20:49,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 18:20:49,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 18:20:49,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:49,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:49,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 18:20:49,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:20:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 18:20:49,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:20:49,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969781658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:20:49,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:20:49,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 18:20:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371720289] [2025-02-06 18:20:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:20:49,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:20:49,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:20:49,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:20:49,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:20:49,301 INFO L87 Difference]: Start difference. First operand 1481 states and 2109 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:20:49,433 INFO L93 Difference]: Finished difference Result 2776 states and 3972 transitions. [2025-02-06 18:20:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:20:49,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2025-02-06 18:20:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:20:49,440 INFO L225 Difference]: With dead ends: 2776 [2025-02-06 18:20:49,440 INFO L226 Difference]: Without dead ends: 1484 [2025-02-06 18:20:49,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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-06 18:20:49,443 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 0 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:20:49,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2243 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:20:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-02-06 18:20:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2025-02-06 18:20:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1441 states have (on average 1.421235253296322) internal successors, (2048), 1469 states have internal predecessors, (2048), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-02-06 18:20:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 2116 transitions. [2025-02-06 18:20:49,473 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 2116 transitions. Word has length 193 [2025-02-06 18:20:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:20:49,473 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 2116 transitions. [2025-02-06 18:20:49,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:20:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2116 transitions. [2025-02-06 18:20:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-06 18:20:49,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:20:49,475 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:20:49,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 18:20:49,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:49,676 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:20:49,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:20:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash -526034582, now seen corresponding path program 1 times [2025-02-06 18:20:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:20:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791618750] [2025-02-06 18:20:49,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:20:49,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 18:20:50,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 18:20:50,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:50,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 18:20:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:20:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791618750] [2025-02-06 18:20:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791618750] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:20:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016999894] [2025-02-06 18:20:50,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:20:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:20:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:20:50,518 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-06 18:20:50,520 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-06 18:20:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 18:20:51,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 18:20:51,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:20:51,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:20:51,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 139 conjuncts are in the unsatisfiable core [2025-02-06 18:20:51,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:20:51,281 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-06 18:20:51,321 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-06 18:20:51,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-02-06 18:20:51,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-02-06 18:20:51,719 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 23 treesize of output 11 [2025-02-06 18:20:51,742 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-06 18:20:51,743 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-06 18:20:51,755 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-06 18:20:51,824 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-06 18:20:51,830 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-06 18:20:51,973 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:20:51,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 18:20:51,979 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 24 treesize of output 11