./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-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_BER_nondet_test3-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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:08:30,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:08:31,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:08:31,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:08:31,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:08:31,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:08:31,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:08:31,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:08:31,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:08:31,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:08:31,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:08:31,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:08:31,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:08:31,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:08:31,059 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:08:31,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:08:31,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:08:31,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:08:31,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:08:31,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:08:31,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:08:31,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:08:31,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:08:31,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:08:31,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:08:31,062 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:08:31,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:08:31,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:08:31,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:08:31,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:08:31,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:08:31,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:08:31,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:08:31,062 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2025-02-06 18:08:31,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:08:31,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:08:31,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:08:31,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:08:31,318 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:08:31,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2025-02-06 18:08:32,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c6dd02df/25b5336853a14fc89c06f8dd602a3b74/FLAGf2cdf43c8 [2025-02-06 18:08:32,830 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:08:32,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2025-02-06 18:08:32,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c6dd02df/25b5336853a14fc89c06f8dd602a3b74/FLAGf2cdf43c8 [2025-02-06 18:08:32,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c6dd02df/25b5336853a14fc89c06f8dd602a3b74 [2025-02-06 18:08:32,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:08:32,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:08:32,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:08:32,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:08:32,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:08:32,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:08:32" (1/1) ... [2025-02-06 18:08:32,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da0ee5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:32, skipping insertion in model container [2025-02-06 18:08:32,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:08:32" (1/1) ... [2025-02-06 18:08:32,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:08:33,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:08:33,293 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:08:33,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:08:33,378 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:08:33,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33 WrapperNode [2025-02-06 18:08:33,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:08:33,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:08:33,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:08:33,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:08:33,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,466 INFO L138 Inliner]: procedures = 177, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1397 [2025-02-06 18:08:33,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:08:33,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:08:33,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:08:33,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:08:33,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,547 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-02-06 18:08:33,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:08:33,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:08:33,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:08:33,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:08:33,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (1/1) ... [2025-02-06 18:08:33,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:08:33,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:08:33,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:08:33,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:08:33,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:08:33,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:08:33,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:08:33,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 18:08:33,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 18:08:33,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:08:33,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:08:33,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:08:33,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:08:33,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:08:33,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:08:33,637 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:08:33,637 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:08:33,637 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:08:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:08:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:08:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:08:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:08:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:08:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:08:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:08:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:08:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:08:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:08:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:08:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:08:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:08:33,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:08:33,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:08:33,828 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:08:33,829 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:08:34,795 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 18:08:34,857 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2025-02-06 18:08:34,858 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:08:34,890 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:08:34,890 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 18:08:34,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:08:34 BoogieIcfgContainer [2025-02-06 18:08:34,891 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:08:34,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:08:34,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:08:34,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:08:34,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:08:32" (1/3) ... [2025-02-06 18:08:34,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61db15aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:08:34, skipping insertion in model container [2025-02-06 18:08:34,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:08:33" (2/3) ... [2025-02-06 18:08:34,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61db15aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:08:34, skipping insertion in model container [2025-02-06 18:08:34,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:08:34" (3/3) ... [2025-02-06 18:08:34,897 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-1.i [2025-02-06 18:08:34,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:08:34,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test3-1.i that has 5 procedures, 417 locations, 1 initial locations, 38 loop locations, and 6 error locations. [2025-02-06 18:08:34,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:08:34,985 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;@7e6760d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:08:34,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:08:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 409 states, 395 states have (on average 1.620253164556962) internal successors, (640), 402 states have internal predecessors, (640), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 18:08:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:08:34,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:34,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:34,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:35,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:35,000 INFO L85 PathProgramCache]: Analyzing trace with hash -967080908, now seen corresponding path program 1 times [2025-02-06 18:08:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:35,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172639122] [2025-02-06 18:08:35,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:35,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:08:35,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:08:35,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:35,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:35,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:35,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172639122] [2025-02-06 18:08:35,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172639122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:35,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:35,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:08:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457002832] [2025-02-06 18:08:35,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:35,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:08:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:35,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:08:35,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:08:35,130 INFO L87 Difference]: Start difference. First operand has 409 states, 395 states have (on average 1.620253164556962) internal successors, (640), 402 states have internal predecessors, (640), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:35,209 INFO L93 Difference]: Finished difference Result 814 states and 1297 transitions. [2025-02-06 18:08:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:08:35,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 18:08:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:35,217 INFO L225 Difference]: With dead ends: 814 [2025-02-06 18:08:35,217 INFO L226 Difference]: Without dead ends: 400 [2025-02-06 18:08:35,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:08:35,221 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:35,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:08:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-06 18:08:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-06 18:08:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 388 states have (on average 1.458762886597938) internal successors, (566), 394 states have internal predecessors, (566), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:08:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 574 transitions. [2025-02-06 18:08:35,260 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 574 transitions. Word has length 8 [2025-02-06 18:08:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:35,260 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 574 transitions. [2025-02-06 18:08:35,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 574 transitions. [2025-02-06 18:08:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:08:35,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:35,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:35,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:08:35,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:35,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash -967079947, now seen corresponding path program 1 times [2025-02-06 18:08:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:35,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153148931] [2025-02-06 18:08:35,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:35,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:35,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:08:35,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:08:35,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:35,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 18:08:35,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139002441] [2025-02-06 18:08:35,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:35,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:35,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:08:35,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:08:35,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:08:35,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:08:35,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:08:35,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:35,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:35,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 18:08:35,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:08:35,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:08:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:35,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:08:35,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:35,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153148931] [2025-02-06 18:08:35,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 18:08:35,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139002441] [2025-02-06 18:08:35,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139002441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:35,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:35,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:08:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481699622] [2025-02-06 18:08:35,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:35,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:35,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:35,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:35,471 INFO L87 Difference]: Start difference. First operand 400 states and 574 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:35,686 INFO L93 Difference]: Finished difference Result 789 states and 1138 transitions. [2025-02-06 18:08:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:08:35,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 18:08:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:35,692 INFO L225 Difference]: With dead ends: 789 [2025-02-06 18:08:35,693 INFO L226 Difference]: Without dead ends: 787 [2025-02-06 18:08:35,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:08:35,694 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 549 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:35,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1520 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:08:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-02-06 18:08:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 406. [2025-02-06 18:08:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 394 states have (on average 1.4543147208121827) internal successors, (573), 400 states have internal predecessors, (573), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:08:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 581 transitions. [2025-02-06 18:08:35,718 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 581 transitions. Word has length 8 [2025-02-06 18:08:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:35,718 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 581 transitions. [2025-02-06 18:08:35,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 581 transitions. [2025-02-06 18:08:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 18:08:35,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:35,720 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] [2025-02-06 18:08:35,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 18:08:35,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:35,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:35,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:35,926 INFO L85 PathProgramCache]: Analyzing trace with hash -932906912, now seen corresponding path program 1 times [2025-02-06 18:08:35,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:35,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017333167] [2025-02-06 18:08:35,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:35,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 18:08:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 18:08:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:36,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017333167] [2025-02-06 18:08:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017333167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:36,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:36,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:08:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389671907] [2025-02-06 18:08:36,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:36,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:36,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:36,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:36,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:36,234 INFO L87 Difference]: Start difference. First operand 406 states and 581 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:08:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:36,357 INFO L93 Difference]: Finished difference Result 555 states and 792 transitions. [2025-02-06 18:08:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:08:36,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-02-06 18:08:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:36,359 INFO L225 Difference]: With dead ends: 555 [2025-02-06 18:08:36,359 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 18:08:36,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:08:36,361 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 36 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:36,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1297 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 18:08:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-02-06 18:08:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 352 states have (on average 1.4090909090909092) internal successors, (496), 358 states have internal predecessors, (496), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:08:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 504 transitions. [2025-02-06 18:08:36,371 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 504 transitions. Word has length 70 [2025-02-06 18:08:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 504 transitions. [2025-02-06 18:08:36,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:08:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 504 transitions. [2025-02-06 18:08:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 18:08:36,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:36,373 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] [2025-02-06 18:08:36,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:08:36,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:36,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1128141718, now seen corresponding path program 1 times [2025-02-06 18:08:36,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:36,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324437702] [2025-02-06 18:08:36,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:36,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 18:08:36,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 18:08:36,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:36,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324437702] [2025-02-06 18:08:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324437702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:36,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:08:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767840069] [2025-02-06 18:08:36,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:36,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:36,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:36,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:36,498 INFO L87 Difference]: Start difference. First operand 364 states and 504 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:08:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:36,628 INFO L93 Difference]: Finished difference Result 507 states and 698 transitions. [2025-02-06 18:08:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:08:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-02-06 18:08:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:36,631 INFO L225 Difference]: With dead ends: 507 [2025-02-06 18:08:36,631 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 18:08:36,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:08:36,639 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 9 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:36,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1298 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 18:08:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-06 18:08:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 346 states have (on average 1.4046242774566473) internal successors, (486), 352 states have internal predecessors, (486), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:08:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 494 transitions. [2025-02-06 18:08:36,660 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 494 transitions. Word has length 70 [2025-02-06 18:08:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:36,660 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 494 transitions. [2025-02-06 18:08:36,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:08:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 494 transitions. [2025-02-06 18:08:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 18:08:36,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:36,665 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] [2025-02-06 18:08:36,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:08:36,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:36,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1065621606, now seen corresponding path program 1 times [2025-02-06 18:08:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:36,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803410926] [2025-02-06 18:08:36,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:36,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 18:08:36,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 18:08:36,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:36,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803410926] [2025-02-06 18:08:36,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803410926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:36,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:36,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:08:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163315842] [2025-02-06 18:08:36,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:36,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:36,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:36,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:36,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:36,828 INFO L87 Difference]: Start difference. First operand 358 states and 494 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:08:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:36,926 INFO L93 Difference]: Finished difference Result 501 states and 684 transitions. [2025-02-06 18:08:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:08:36,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-02-06 18:08:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:36,930 INFO L225 Difference]: With dead ends: 501 [2025-02-06 18:08:36,932 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 18:08:36,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:08:36,933 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 0 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:36,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1351 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 18:08:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-02-06 18:08:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.4052478134110786) internal successors, (482), 348 states have internal predecessors, (482), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:08:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 488 transitions. [2025-02-06 18:08:36,953 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 488 transitions. Word has length 70 [2025-02-06 18:08:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:36,953 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 488 transitions. [2025-02-06 18:08:36,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:08:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 488 transitions. [2025-02-06 18:08:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 18:08:36,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:36,957 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] [2025-02-06 18:08:36,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:08:36,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:36,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 67940547, now seen corresponding path program 1 times [2025-02-06 18:08:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268497717] [2025-02-06 18:08:36,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:36,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 18:08:37,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 18:08:37,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:37,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:37,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268497717] [2025-02-06 18:08:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268497717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:37,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:37,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:08:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588122512] [2025-02-06 18:08:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:37,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:08:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:37,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:08:37,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:08:37,089 INFO L87 Difference]: Start difference. First operand 353 states and 488 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:37,175 INFO L93 Difference]: Finished difference Result 498 states and 680 transitions. [2025-02-06 18:08:37,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:08:37,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2025-02-06 18:08:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:37,178 INFO L225 Difference]: With dead ends: 498 [2025-02-06 18:08:37,178 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 18:08:37,178 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:08:37,179 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 15 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:37,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 869 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 18:08:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-02-06 18:08:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.3935860058309038) internal successors, (478), 348 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:08:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 484 transitions. [2025-02-06 18:08:37,190 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 484 transitions. Word has length 71 [2025-02-06 18:08:37,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:37,191 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 484 transitions. [2025-02-06 18:08:37,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 484 transitions. [2025-02-06 18:08:37,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:08:37,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:37,193 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] [2025-02-06 18:08:37,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:08:37,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:37,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1653824288, now seen corresponding path program 1 times [2025-02-06 18:08:37,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:37,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200889720] [2025-02-06 18:08:37,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:37,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:08:37,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:08:37,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:37,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:37,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200889720] [2025-02-06 18:08:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200889720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:37,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:37,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:08:37,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120815379] [2025-02-06 18:08:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:37,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:37,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:37,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:37,424 INFO L87 Difference]: Start difference. First operand 353 states and 484 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:37,561 INFO L93 Difference]: Finished difference Result 700 states and 961 transitions. [2025-02-06 18:08:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:08:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-02-06 18:08:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:37,563 INFO L225 Difference]: With dead ends: 700 [2025-02-06 18:08:37,563 INFO L226 Difference]: Without dead ends: 356 [2025-02-06 18:08:37,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:08:37,565 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 106 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:37,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1167 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-06 18:08:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 353. [2025-02-06 18:08:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.3731778425655976) internal successors, (471), 348 states have internal predecessors, (471), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:08:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 477 transitions. [2025-02-06 18:08:37,576 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 477 transitions. Word has length 81 [2025-02-06 18:08:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:37,576 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 477 transitions. [2025-02-06 18:08:37,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 477 transitions. [2025-02-06 18:08:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:08:37,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:37,578 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] [2025-02-06 18:08:37,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:08:37,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:37,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash 267880569, now seen corresponding path program 1 times [2025-02-06 18:08:37,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:37,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233485203] [2025-02-06 18:08:37,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:37,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:08:37,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:08:37,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233485203] [2025-02-06 18:08:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233485203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:37,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:08:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541045682] [2025-02-06 18:08:37,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:37,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:37,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:37,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:37,739 INFO L87 Difference]: Start difference. First operand 353 states and 477 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:37,850 INFO L93 Difference]: Finished difference Result 649 states and 869 transitions. [2025-02-06 18:08:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:08:37,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-02-06 18:08:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:37,852 INFO L225 Difference]: With dead ends: 649 [2025-02-06 18:08:37,852 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 18:08:37,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:08:37,856 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 9 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:37,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1034 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 18:08:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-02-06 18:08:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 295 states have (on average 1.3254237288135593) internal successors, (391), 300 states have internal predecessors, (391), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:08:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 397 transitions. [2025-02-06 18:08:37,873 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 397 transitions. Word has length 81 [2025-02-06 18:08:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:37,873 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 397 transitions. [2025-02-06 18:08:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 397 transitions. [2025-02-06 18:08:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:08:37,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:37,874 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] [2025-02-06 18:08:37,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:08:37,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:37,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:37,875 INFO L85 PathProgramCache]: Analyzing trace with hash -170128934, now seen corresponding path program 1 times [2025-02-06 18:08:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029212896] [2025-02-06 18:08:37,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:37,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:37,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:08:37,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:08:37,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:37,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:08:38,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:38,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029212896] [2025-02-06 18:08:38,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029212896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:38,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:38,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:08:38,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727690884] [2025-02-06 18:08:38,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:38,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:08:38,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:38,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:08:38,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:08:38,043 INFO L87 Difference]: Start difference. First operand 305 states and 397 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:38,164 INFO L93 Difference]: Finished difference Result 768 states and 1006 transitions. [2025-02-06 18:08:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:08:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-02-06 18:08:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:38,167 INFO L225 Difference]: With dead ends: 768 [2025-02-06 18:08:38,167 INFO L226 Difference]: Without dead ends: 391 [2025-02-06 18:08:38,168 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:08:38,169 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 170 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:38,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 708 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-06 18:08:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2025-02-06 18:08:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.324538258575198) internal successors, (502), 384 states have internal predecessors, (502), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:08:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 508 transitions. [2025-02-06 18:08:38,187 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 508 transitions. Word has length 81 [2025-02-06 18:08:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:38,187 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 508 transitions. [2025-02-06 18:08:38,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:08:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 508 transitions. [2025-02-06 18:08:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 18:08:38,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:38,193 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] [2025-02-06 18:08:38,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:08:38,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash 935621305, now seen corresponding path program 1 times [2025-02-06 18:08:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476898962] [2025-02-06 18:08:38,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:38,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 18:08:38,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 18:08:38,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:38,507 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:08:38,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476898962] [2025-02-06 18:08:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476898962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:38,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:08:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080040467] [2025-02-06 18:08:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:38,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:08:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:38,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:08:38,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:08:38,510 INFO L87 Difference]: Start difference. First operand 389 states and 508 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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:08:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:38,615 INFO L93 Difference]: Finished difference Result 598 states and 780 transitions. [2025-02-06 18:08:38,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:08:38,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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 96 [2025-02-06 18:08:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:38,618 INFO L225 Difference]: With dead ends: 598 [2025-02-06 18:08:38,618 INFO L226 Difference]: Without dead ends: 596 [2025-02-06 18:08:38,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:08:38,619 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 286 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:38,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1051 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-06 18:08:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 452. [2025-02-06 18:08:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 439 states have (on average 1.3189066059225512) internal successors, (579), 444 states have internal predecessors, (579), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 18:08:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 591 transitions. [2025-02-06 18:08:38,632 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 591 transitions. Word has length 96 [2025-02-06 18:08:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:38,632 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 591 transitions. [2025-02-06 18:08:38,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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:08:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 591 transitions. [2025-02-06 18:08:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 18:08:38,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:38,636 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:38,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:08:38,636 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:38,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:38,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1416410601, now seen corresponding path program 1 times [2025-02-06 18:08:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:38,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947745725] [2025-02-06 18:08:38,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:38,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:08:38,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:08:38,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:38,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:08:39,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947745725] [2025-02-06 18:08:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947745725] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:08:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598678315] [2025-02-06 18:08:39,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:39,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:39,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:08:39,038 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:08:39,042 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:08:39,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:08:39,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:08:39,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:39,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:39,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 18:08:39,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:08:39,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:08:39,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:08:39,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 18:08:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:08:40,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:08:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598678315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:08:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:08:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517614783] [2025-02-06 18:08:40,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:40,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:08:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:40,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:08:40,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:08:40,243 INFO L87 Difference]: Start difference. First operand 452 states and 591 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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:08:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:42,331 INFO L93 Difference]: Finished difference Result 1008 states and 1326 transitions. [2025-02-06 18:08:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:08:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 102 [2025-02-06 18:08:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:42,335 INFO L225 Difference]: With dead ends: 1008 [2025-02-06 18:08:42,335 INFO L226 Difference]: Without dead ends: 596 [2025-02-06 18:08:42,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 1 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:08:42,339 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 466 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:42,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2243 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 18:08:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-06 18:08:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 452. [2025-02-06 18:08:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 439 states have (on average 1.316628701594533) internal successors, (578), 444 states have internal predecessors, (578), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 18:08:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 590 transitions. [2025-02-06 18:08:42,357 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 590 transitions. Word has length 102 [2025-02-06 18:08:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:42,358 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 590 transitions. [2025-02-06 18:08:42,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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:08:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 590 transitions. [2025-02-06 18:08:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:08:42,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:42,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:42,372 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:08:42,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:42,560 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:42,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1462279884, now seen corresponding path program 1 times [2025-02-06 18:08:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:42,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992850399] [2025-02-06 18:08:42,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:42,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:08:42,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:08:42,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:42,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:08:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:42,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992850399] [2025-02-06 18:08:42,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992850399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:08:42,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707420930] [2025-02-06 18:08:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:42,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:42,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:08:42,984 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:08:42,989 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:08:43,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:08:43,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:08:43,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:43,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:43,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 18:08:43,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:08:43,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:08:43,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:08:43,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 18:08:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:08:44,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:08:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707420930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:08:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-02-06 18:08:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288016402] [2025-02-06 18:08:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:08:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:44,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:08:44,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:08:44,177 INFO L87 Difference]: Start difference. First operand 452 states and 590 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:08:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:46,054 INFO L93 Difference]: Finished difference Result 1008 states and 1325 transitions. [2025-02-06 18:08:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:08:46,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-06 18:08:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:46,059 INFO L225 Difference]: With dead ends: 1008 [2025-02-06 18:08:46,059 INFO L226 Difference]: Without dead ends: 601 [2025-02-06 18:08:46,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-06 18:08:46,061 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 528 mSDsluCounter, 2141 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:46,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 2514 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 18:08:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-06 18:08:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 456. [2025-02-06 18:08:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 443 states have (on average 1.3160270880361173) internal successors, (583), 448 states have internal predecessors, (583), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 18:08:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 595 transitions. [2025-02-06 18:08:46,075 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 595 transitions. Word has length 103 [2025-02-06 18:08:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:46,075 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 595 transitions. [2025-02-06 18:08:46,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:08:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 595 transitions. [2025-02-06 18:08:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:08:46,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:46,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:46,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:08:46,281 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:08:46,281 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:46,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:46,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1586914022, now seen corresponding path program 1 times [2025-02-06 18:08:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:46,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885281118] [2025-02-06 18:08:46,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:46,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:08:46,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:08:46,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:46,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:08:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:46,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885281118] [2025-02-06 18:08:46,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885281118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:46,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:46,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:08:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730762306] [2025-02-06 18:08:46,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:08:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:46,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:08:46,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:08:46,615 INFO L87 Difference]: Start difference. First operand 456 states and 595 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:08:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:46,904 INFO L93 Difference]: Finished difference Result 871 states and 1148 transitions. [2025-02-06 18:08:46,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:08:46,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 18:08:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:46,907 INFO L225 Difference]: With dead ends: 871 [2025-02-06 18:08:46,907 INFO L226 Difference]: Without dead ends: 462 [2025-02-06 18:08:46,908 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:08:46,909 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 5 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:46,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1252 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:08:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-02-06 18:08:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2025-02-06 18:08:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 449 states have (on average 1.311804008908686) internal successors, (589), 454 states have internal predecessors, (589), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 18:08:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 601 transitions. [2025-02-06 18:08:46,925 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 601 transitions. Word has length 104 [2025-02-06 18:08:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:46,925 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 601 transitions. [2025-02-06 18:08:46,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:08:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 601 transitions. [2025-02-06 18:08:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:08:46,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:46,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:46,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:08:46,928 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:46,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 98692002, now seen corresponding path program 1 times [2025-02-06 18:08:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:46,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791503555] [2025-02-06 18:08:46,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:46,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:08:46,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:08:46,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:46,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:08:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:47,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791503555] [2025-02-06 18:08:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791503555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:08:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:08:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079425201] [2025-02-06 18:08:47,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:47,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:08:47,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:47,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:08:47,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:08:47,225 INFO L87 Difference]: Start difference. First operand 462 states and 601 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:08:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:47,572 INFO L93 Difference]: Finished difference Result 877 states and 1152 transitions. [2025-02-06 18:08:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:08:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 18:08:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:47,574 INFO L225 Difference]: With dead ends: 877 [2025-02-06 18:08:47,575 INFO L226 Difference]: Without dead ends: 472 [2025-02-06 18:08:47,575 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:08:47,576 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 10 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:47,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1806 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:08:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-06 18:08:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 470. [2025-02-06 18:08:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 457 states have (on average 1.3107221006564551) internal successors, (599), 462 states have internal predecessors, (599), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 18:08:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 611 transitions. [2025-02-06 18:08:47,587 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 611 transitions. Word has length 104 [2025-02-06 18:08:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:47,587 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 611 transitions. [2025-02-06 18:08:47,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:08:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 611 transitions. [2025-02-06 18:08:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 18:08:47,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:47,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:08:47,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:47,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1276702448, now seen corresponding path program 1 times [2025-02-06 18:08:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469682877] [2025-02-06 18:08:47,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:47,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:08:47,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:08:47,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:47,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:08:47,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469682877] [2025-02-06 18:08:47,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469682877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:08:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814502400] [2025-02-06 18:08:47,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:47,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:47,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:08:47,871 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:08:47,872 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:08:48,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:08:48,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:08:48,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:48,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:48,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 18:08:48,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:08:48,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:08:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:08:48,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:08:48,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814502400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:48,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:08:48,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-02-06 18:08:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059844983] [2025-02-06 18:08:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:48,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:08:48,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:48,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:08:48,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:08:48,187 INFO L87 Difference]: Start difference. First operand 470 states and 611 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:08:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:08:48,331 INFO L93 Difference]: Finished difference Result 842 states and 1101 transitions. [2025-02-06 18:08:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:08:48,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-02-06 18:08:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:08:48,334 INFO L225 Difference]: With dead ends: 842 [2025-02-06 18:08:48,334 INFO L226 Difference]: Without dead ends: 473 [2025-02-06 18:08:48,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:08:48,335 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 186 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:08:48,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1916 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:08:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-06 18:08:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-02-06 18:08:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 459 states have (on average 1.3115468409586057) internal successors, (602), 465 states have internal predecessors, (602), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:08:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 616 transitions. [2025-02-06 18:08:48,345 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 616 transitions. Word has length 105 [2025-02-06 18:08:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:08:48,345 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 616 transitions. [2025-02-06 18:08:48,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:08:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 616 transitions. [2025-02-06 18:08:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 18:08:48,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:08:48,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:08:48,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:08:48,546 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:08:48,547 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:08:48,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:08:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1954200300, now seen corresponding path program 1 times [2025-02-06 18:08:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:08:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129955703] [2025-02-06 18:08:48,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:08:48,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 18:08:48,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 18:08:48,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:08:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:08:48,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129955703] [2025-02-06 18:08:48,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129955703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:08:48,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056088993] [2025-02-06 18:08:48,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:08:48,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:08:48,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:08:48,843 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:08:48,849 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:08:49,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 18:08:49,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 18:08:49,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:08:49,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:08:49,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 18:08:49,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:08:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:08:58,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:08:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056088993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:08:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:08:58,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-02-06 18:08:58,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939784515] [2025-02-06 18:08:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:08:58,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:08:58,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:08:58,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:08:58,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:08:58,786 INFO L87 Difference]: Start difference. First operand 473 states and 616 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:04,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 18:09:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:04,785 INFO L93 Difference]: Finished difference Result 905 states and 1191 transitions. [2025-02-06 18:09:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:09:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-02-06 18:09:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:04,787 INFO L225 Difference]: With dead ends: 905 [2025-02-06 18:09:04,787 INFO L226 Difference]: Without dead ends: 479 [2025-02-06 18:09:04,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:09:04,788 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 8 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:04,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1806 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-02-06 18:09:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-06 18:09:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 469. [2025-02-06 18:09:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 455 states have (on average 1.3076923076923077) internal successors, (595), 461 states have internal predecessors, (595), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:09:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 609 transitions. [2025-02-06 18:09:04,798 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 609 transitions. Word has length 107 [2025-02-06 18:09:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:04,798 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 609 transitions. [2025-02-06 18:09:04,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 609 transitions. [2025-02-06 18:09:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 18:09:04,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:04,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:04,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:09:04,999 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,SelfDestructingSolverStorable15 [2025-02-06 18:09:05,000 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:09:05,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1520374715, now seen corresponding path program 1 times [2025-02-06 18:09:05,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:05,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055348869] [2025-02-06 18:09:05,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:05,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 18:09:05,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 18:09:05,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:05,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:09:05,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:05,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055348869] [2025-02-06 18:09:05,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055348869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:09:05,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671592362] [2025-02-06 18:09:05,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:05,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:09:05,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:09:05,269 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:09:05,270 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:09:05,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 18:09:05,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 18:09:05,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:05,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:05,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 18:09:05,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:09:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:09:05,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:09:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671592362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:09:05,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:09:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-02-06 18:09:05,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067207738] [2025-02-06 18:09:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:09:05,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:09:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:09:05,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:09:05,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:09:05,721 INFO L87 Difference]: Start difference. First operand 469 states and 609 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:06,038 INFO L93 Difference]: Finished difference Result 896 states and 1173 transitions. [2025-02-06 18:09:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:09:06,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 108 [2025-02-06 18:09:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:06,039 INFO L225 Difference]: With dead ends: 896 [2025-02-06 18:09:06,039 INFO L226 Difference]: Without dead ends: 489 [2025-02-06 18:09:06,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:09:06,040 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 31 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:06,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2114 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:09:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-06 18:09:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 479. [2025-02-06 18:09:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 465 states have (on average 1.3053763440860215) internal successors, (607), 471 states have internal predecessors, (607), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:09:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 621 transitions. [2025-02-06 18:09:06,049 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 621 transitions. Word has length 108 [2025-02-06 18:09:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:06,049 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 621 transitions. [2025-02-06 18:09:06,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 621 transitions. [2025-02-06 18:09:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 18:09:06,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:06,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:06,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 18:09:06,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 18:09:06,254 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:09:06,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash -971342077, now seen corresponding path program 1 times [2025-02-06 18:09:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:06,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475373156] [2025-02-06 18:09:06,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:06,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:06,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 18:09:06,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 18:09:06,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:06,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:09:06,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475373156] [2025-02-06 18:09:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475373156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:09:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:09:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 18:09:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102766523] [2025-02-06 18:09:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:09:06,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 18:09:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:09:06,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 18:09:06,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:09:06,632 INFO L87 Difference]: Start difference. First operand 479 states and 621 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:09:06,938 INFO L93 Difference]: Finished difference Result 911 states and 1191 transitions. [2025-02-06 18:09:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:09:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 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 108 [2025-02-06 18:09:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:09:06,941 INFO L225 Difference]: With dead ends: 911 [2025-02-06 18:09:06,941 INFO L226 Difference]: Without dead ends: 499 [2025-02-06 18:09:06,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:09:06,942 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 16 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:09:06,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1912 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:09:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-06 18:09:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 493. [2025-02-06 18:09:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 479 states have (on average 1.3048016701461378) internal successors, (625), 485 states have internal predecessors, (625), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:09:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 639 transitions. [2025-02-06 18:09:06,955 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 639 transitions. Word has length 108 [2025-02-06 18:09:06,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:09:06,955 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 639 transitions. [2025-02-06 18:09:06,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:09:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 639 transitions. [2025-02-06 18:09:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 18:09:06,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:09:06,956 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:09:06,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:09:06,957 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:09:06,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:09:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash -227560051, now seen corresponding path program 1 times [2025-02-06 18:09:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:09:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124313760] [2025-02-06 18:09:06,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:09:07,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 18:09:07,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 18:09:07,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:07,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:09:07,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:09:07,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124313760] [2025-02-06 18:09:07,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124313760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:09:07,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732496711] [2025-02-06 18:09:07,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:09:07,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:09:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:09:07,282 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:09:07,283 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:09:07,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 18:09:07,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 18:09:07,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:09:07,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:09:07,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-06 18:09:07,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:09:07,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:09:08,060 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 19 treesize of output 1 [2025-02-06 18:09:08,062 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 19 treesize of output 1 [2025-02-06 18:09:08,078 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-02-06 18:09:08,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-02-06 18:09:08,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2025-02-06 18:09:08,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 18:09:08,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 18:09:08,215 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 20 treesize of output 1