./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_compareModified_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_compareModified_ground.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 ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:18:27,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:18:27,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:18:27,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:18:27,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:18:27,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:18:27,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:18:27,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:18:27,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:18:27,099 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:18:27,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:18:27,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:18:27,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:18:27,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:18:27,100 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:18:27,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:18:27,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:18:27,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:18:27,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:18:27,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:18:27,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:18:27,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:18:27,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:18:27,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:18:27,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:27,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:18:27,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:18:27,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:18:27,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:18:27,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:27,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:18:27,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:18:27,104 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 -> ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e [2025-01-10 01:18:27,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:18:27,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:18:27,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:18:27,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:18:27,367 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:18:27,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2025-01-10 01:18:28,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/059e625a8/804900086abf4bf38824a22f7d1aa212/FLAGe692207c7 [2025-01-10 01:18:28,825 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:18:28,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2025-01-10 01:18:28,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/059e625a8/804900086abf4bf38824a22f7d1aa212/FLAGe692207c7 [2025-01-10 01:18:28,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/059e625a8/804900086abf4bf38824a22f7d1aa212 [2025-01-10 01:18:28,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:18:28,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:18:28,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:18:28,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:18:28,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:18:28,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:18:28" (1/1) ... [2025-01-10 01:18:28,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3807b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:28, skipping insertion in model container [2025-01-10 01:18:28,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:18:28" (1/1) ... [2025-01-10 01:18:28,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:18:28,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:18:28,987 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:18:29,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:18:29,017 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:18:29,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29 WrapperNode [2025-01-10 01:18:29,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:18:29,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:18:29,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:18:29,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:18:29,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,048 INFO L138 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2025-01-10 01:18:29,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:18:29,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:18:29,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:18:29,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:18:29,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,063 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 5, 3]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2025-01-10 01:18:29,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,069 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:18:29,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:18:29,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:18:29,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:18:29,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (1/1) ... [2025-01-10 01:18:29,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:29,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:29,096 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-01-10 01:18:29,098 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-01-10 01:18:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:18:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:18:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:18:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:18:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 01:18:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:18:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:18:29,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:18:29,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:18:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:18:29,171 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:18:29,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:18:29,289 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-10 01:18:29,289 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:18:29,295 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:18:29,295 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:18:29,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:29 BoogieIcfgContainer [2025-01-10 01:18:29,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:18:29,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:18:29,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:18:29,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:18:29,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:18:28" (1/3) ... [2025-01-10 01:18:29,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf61231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:18:29, skipping insertion in model container [2025-01-10 01:18:29,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:29" (2/3) ... [2025-01-10 01:18:29,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf61231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:18:29, skipping insertion in model container [2025-01-10 01:18:29,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:29" (3/3) ... [2025-01-10 01:18:29,302 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_compareModified_ground.i [2025-01-10 01:18:29,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:18:29,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_compareModified_ground.i that has 2 procedures, 40 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-01-10 01:18:29,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:18:29,354 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;@37aa046f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:18:29,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 01:18:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:18:29,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:29,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:18:29,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:29,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:18:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952621185] [2025-01-10 01:18:29,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:29,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:18:29,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:18:29,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:29,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952621185] [2025-01-10 01:18:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952621185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:29,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:29,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979024268] [2025-01-10 01:18:29,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:29,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:29,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:29,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:29,601 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-01-10 01:18:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:29,655 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2025-01-10 01:18:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:29,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-01-10 01:18:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:29,665 INFO L225 Difference]: With dead ends: 77 [2025-01-10 01:18:29,665 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:18:29,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:29,671 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:29,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:18:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 01:18:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.5) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-01-10 01:18:29,703 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 4 [2025-01-10 01:18:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:29,703 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-10 01:18:29,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-01-10 01:18:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-01-10 01:18:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:18:29,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:29,705 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:18:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:18:29,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:29,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:29,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1805857894, now seen corresponding path program 1 times [2025-01-10 01:18:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:29,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599819180] [2025-01-10 01:18:29,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:29,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:29,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:18:29,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:18:29,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:29,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:29,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599819180] [2025-01-10 01:18:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599819180] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264889768] [2025-01-10 01:18:29,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:29,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:29,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:29,867 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-01-10 01:18:29,868 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-01-10 01:18:29,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:18:29,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:18:29,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:29,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:29,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:18:29,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:29,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:29,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264889768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:29,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:18:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623094172] [2025-01-10 01:18:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:29,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:18:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:29,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:18:29,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:18:29,972 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:30,000 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-01-10 01:18:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:18:30,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:18:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:30,002 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:18:30,002 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:18:30,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:18:30,003 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:30,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:18:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 01:18:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-01-10 01:18:30,010 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 7 [2025-01-10 01:18:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:30,010 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-10 01:18:30,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-01-10 01:18:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:18:30,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:30,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 01:18:30,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:18:30,215 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-01-10 01:18:30,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:30,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash 147019906, now seen corresponding path program 1 times [2025-01-10 01:18:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543787732] [2025-01-10 01:18:30,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:30,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:30,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:18:30,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:18:30,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:30,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543787732] [2025-01-10 01:18:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543787732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:18:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401980894] [2025-01-10 01:18:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:30,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:30,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:30,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:30,281 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-01-10 01:18:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:30,288 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-01-10 01:18:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:30,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 01:18:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:30,289 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:18:30,289 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:18:30,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:30,290 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:30,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:18:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-01-10 01:18:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-01-10 01:18:30,293 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 8 [2025-01-10 01:18:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:30,293 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-01-10 01:18:30,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 01:18:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-01-10 01:18:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:18:30,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:30,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:30,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:18:30,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:30,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash -442001301, now seen corresponding path program 1 times [2025-01-10 01:18:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:30,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928440759] [2025-01-10 01:18:30,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:30,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:18:30,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:18:30,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:30,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:30,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:30,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928440759] [2025-01-10 01:18:30,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928440759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:30,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620424878] [2025-01-10 01:18:30,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:30,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:30,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:30,369 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-01-10 01:18:30,371 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-01-10 01:18:30,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:18:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:18:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:30,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:30,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:30,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620424878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:30,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:30,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:18:30,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526818928] [2025-01-10 01:18:30,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:30,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:30,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:30,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:30,443 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-01-10 01:18:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:30,454 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-01-10 01:18:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-01-10 01:18:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:30,454 INFO L225 Difference]: With dead ends: 33 [2025-01-10 01:18:30,454 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:18:30,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-01-10 01:18:30,455 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:30,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:18:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:18:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-01-10 01:18:30,459 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 10 [2025-01-10 01:18:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:30,459 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-01-10 01:18:30,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-01-10 01:18:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-01-10 01:18:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:18:30,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:30,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:30,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:18:30,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:30,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash -817138386, now seen corresponding path program 1 times [2025-01-10 01:18:30,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:30,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854394929] [2025-01-10 01:18:30,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:30,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:18:30,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:18:30,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:30,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854394929] [2025-01-10 01:18:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854394929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501372522] [2025-01-10 01:18:30,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:30,730 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-01-10 01:18:30,732 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-01-10 01:18:30,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:18:30,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:18:30,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:30,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:30,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:30,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:30,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:30,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501372522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:30,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:30,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:18:30,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532274346] [2025-01-10 01:18:30,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:30,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:30,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:30,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:30,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:30,808 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-01-10 01:18:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:30,826 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-01-10 01:18:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:30,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-01-10 01:18:30,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:30,829 INFO L225 Difference]: With dead ends: 58 [2025-01-10 01:18:30,829 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:18:30,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-01-10 01:18:30,829 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:30,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:30,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:18:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 01:18:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-01-10 01:18:30,835 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2025-01-10 01:18:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:30,835 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-01-10 01:18:30,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-01-10 01:18:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-01-10 01:18:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:18:30,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:30,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:30,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:18:31,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash -4987706, now seen corresponding path program 1 times [2025-01-10 01:18:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112488324] [2025-01-10 01:18:31,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:31,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:18:31,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:18:31,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:18:31,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112488324] [2025-01-10 01:18:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112488324] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264085972] [2025-01-10 01:18:31,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:31,103 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-01-10 01:18:31,106 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-01-10 01:18:31,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:18:31,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:18:31,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:18:31,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:18:31,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264085972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:18:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374280035] [2025-01-10 01:18:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:31,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:31,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:31,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:31,175 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-10 01:18:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:31,187 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-01-10 01:18:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:31,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-01-10 01:18:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:31,189 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:18:31,189 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:18:31,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-01-10 01:18:31,191 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:31,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:18:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-01-10 01:18:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.36) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-01-10 01:18:31,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2025-01-10 01:18:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:31,198 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-01-10 01:18:31,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-10 01:18:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-01-10 01:18:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:18:31,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:31,199 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] [2025-01-10 01:18:31,207 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-01-10 01:18:31,399 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,SelfDestructingSolverStorable5 [2025-01-10 01:18:31,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:31,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1212394832, now seen corresponding path program 1 times [2025-01-10 01:18:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:31,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346625900] [2025-01-10 01:18:31,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:31,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:18:31,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:18:31,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:31,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346625900] [2025-01-10 01:18:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346625900] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018092956] [2025-01-10 01:18:31,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:31,467 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-01-10 01:18:31,476 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-01-10 01:18:31,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:18:31,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:18:31,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:18:31,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:31,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018092956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-10 01:18:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768487473] [2025-01-10 01:18:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:31,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:31,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:31,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:18:31,548 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-01-10 01:18:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:31,556 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-01-10 01:18:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:31,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2025-01-10 01:18:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:31,560 INFO L225 Difference]: With dead ends: 57 [2025-01-10 01:18:31,561 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:18:31,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-01-10 01:18:31,561 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:31,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:18:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 01:18:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 34 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-01-10 01:18:31,565 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2025-01-10 01:18:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:31,565 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-01-10 01:18:31,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-01-10 01:18:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-01-10 01:18:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:18:31,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:31,568 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] [2025-01-10 01:18:31,576 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-01-10 01:18:31,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 201277582, now seen corresponding path program 1 times [2025-01-10 01:18:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399038855] [2025-01-10 01:18:31,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:31,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:18:31,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:18:31,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399038855] [2025-01-10 01:18:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399038855] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258786930] [2025-01-10 01:18:31,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:31,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:31,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:31,829 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-01-10 01:18:31,830 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-01-10 01:18:31,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:18:31,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:18:31,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:31,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:31,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:18:31,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:31,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:31,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258786930] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:31,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:31,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:18:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681419299] [2025-01-10 01:18:31,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:18:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:31,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:18:31,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:18:31,942 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:18:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:31,963 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-01-10 01:18:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:18:31,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-01-10 01:18:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:31,966 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:18:31,966 INFO L226 Difference]: Without dead ends: 44 [2025-01-10 01:18:31,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:18:31,967 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:31,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-10 01:18:31,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-10 01:18:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 40 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-01-10 01:18:31,973 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 21 [2025-01-10 01:18:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:31,973 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-01-10 01:18:31,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:18:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-01-10 01:18:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 01:18:31,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:31,974 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:31,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:18:32,174 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,SelfDestructingSolverStorable7 [2025-01-10 01:18:32,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:32,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash 571749326, now seen corresponding path program 2 times [2025-01-10 01:18:32,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:32,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174599346] [2025-01-10 01:18:32,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:32,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:32,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:18:32,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 27 statements. [2025-01-10 01:18:32,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:18:32,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:18:32,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:32,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174599346] [2025-01-10 01:18:32,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174599346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:32,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:32,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:32,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234573982] [2025-01-10 01:18:32,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:32,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:32,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:32,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:32,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:32,204 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-01-10 01:18:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:32,227 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-01-10 01:18:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:32,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 27 [2025-01-10 01:18:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:32,228 INFO L225 Difference]: With dead ends: 66 [2025-01-10 01:18:32,228 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:18:32,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:32,230 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:32,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:18:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2025-01-10 01:18:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 44 states have internal predecessors, (52), 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-01-10 01:18:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2025-01-10 01:18:32,240 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 27 [2025-01-10 01:18:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:32,240 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2025-01-10 01:18:32,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-01-10 01:18:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2025-01-10 01:18:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:18:32,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:32,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:32,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:18:32,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:32,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash -863443966, now seen corresponding path program 1 times [2025-01-10 01:18:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217888727] [2025-01-10 01:18:32,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:32,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:18:32,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:18:32,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:18:32,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:32,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217888727] [2025-01-10 01:18:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217888727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:32,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795172888] [2025-01-10 01:18:32,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:32,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:32,301 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-01-10 01:18:32,302 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-01-10 01:18:32,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:18:32,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:18:32,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:18:32,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:32,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:32,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795172888] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:32,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2025-01-10 01:18:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864344532] [2025-01-10 01:18:32,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:32,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:18:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:32,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:18:32,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:18:32,507 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:18:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:32,670 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2025-01-10 01:18:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:18:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-01-10 01:18:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:32,672 INFO L225 Difference]: With dead ends: 115 [2025-01-10 01:18:32,672 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:18:32,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2025-01-10 01:18:32,672 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:32,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 248 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:18:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2025-01-10 01:18:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 65 states have internal predecessors, (74), 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-01-10 01:18:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2025-01-10 01:18:32,678 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 28 [2025-01-10 01:18:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:32,678 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2025-01-10 01:18:32,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:18:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2025-01-10 01:18:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 01:18:32,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:32,679 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:32,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:18:32,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:32,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1474295190, now seen corresponding path program 2 times [2025-01-10 01:18:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029159330] [2025-01-10 01:18:32,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:32,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:18:32,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 45 statements. [2025-01-10 01:18:32,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:18:32,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-10 01:18:32,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:32,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029159330] [2025-01-10 01:18:32,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029159330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:32,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:32,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:32,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528903081] [2025-01-10 01:18:32,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:32,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:32,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:32,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:32,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:32,913 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-01-10 01:18:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:32,935 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-01-10 01:18:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:32,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 45 [2025-01-10 01:18:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:32,936 INFO L225 Difference]: With dead ends: 77 [2025-01-10 01:18:32,936 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 01:18:32,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:32,936 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:32,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 01:18:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-10 01:18:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:18:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2025-01-10 01:18:32,941 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 45 [2025-01-10 01:18:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:32,941 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2025-01-10 01:18:32,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-01-10 01:18:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2025-01-10 01:18:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 01:18:32,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:32,942 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:32,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:18:32,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:32,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash -717480289, now seen corresponding path program 1 times [2025-01-10 01:18:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:32,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958310856] [2025-01-10 01:18:32,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:32,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:32,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:18:32,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:18:32,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:32,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-10 01:18:33,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:33,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958310856] [2025-01-10 01:18:33,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958310856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:33,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889479231] [2025-01-10 01:18:33,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:33,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:33,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:33,033 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:18:33,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:18:33,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:18:33,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:18:33,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:33,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:33,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:18:33,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:18:33,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:18:33,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889479231] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:33,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:33,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 35 [2025-01-10 01:18:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093418288] [2025-01-10 01:18:33,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:33,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:18:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:33,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:18:33,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:18:33,546 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:18:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:34,004 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2025-01-10 01:18:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-10 01:18:34,007 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-01-10 01:18:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:34,007 INFO L225 Difference]: With dead ends: 168 [2025-01-10 01:18:34,007 INFO L226 Difference]: Without dead ends: 117 [2025-01-10 01:18:34,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=855, Invalid=3177, Unknown=0, NotChecked=0, Total=4032 [2025-01-10 01:18:34,009 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:34,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 278 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-10 01:18:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2025-01-10 01:18:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 100 states have (on average 1.14) internal successors, (114), 103 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:18:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2025-01-10 01:18:34,015 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 53 [2025-01-10 01:18:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:34,015 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2025-01-10 01:18:34,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:18:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2025-01-10 01:18:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 01:18:34,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:34,019 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:34,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:18:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:34,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:34,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1889195449, now seen corresponding path program 2 times [2025-01-10 01:18:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181680998] [2025-01-10 01:18:34,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:34,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-01-10 01:18:34,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:18:34,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:18:34,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-01-10 01:18:34,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181680998] [2025-01-10 01:18:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181680998] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893600804] [2025-01-10 01:18:34,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:34,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:34,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:34,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:18:34,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:18:34,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-01-10 01:18:34,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:18:34,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:18:34,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:34,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 01:18:34,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:18:35,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:18:35,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893600804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:35,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:35,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 68 [2025-01-10 01:18:35,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970289521] [2025-01-10 01:18:35,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:35,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-01-10 01:18:35,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:35,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-01-10 01:18:35,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1064, Invalid=3492, Unknown=0, NotChecked=0, Total=4556 [2025-01-10 01:18:35,936 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 68 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 68 states have internal predecessors, (132), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:18:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:36,149 INFO L93 Difference]: Finished difference Result 217 states and 259 transitions. [2025-01-10 01:18:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-01-10 01:18:36,149 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 68 states have internal predecessors, (132), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-01-10 01:18:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:36,150 INFO L225 Difference]: With dead ends: 217 [2025-01-10 01:18:36,150 INFO L226 Difference]: Without dead ends: 156 [2025-01-10 01:18:36,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1064, Invalid=3492, Unknown=0, NotChecked=0, Total=4556 [2025-01-10 01:18:36,152 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:36,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 284 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:18:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-10 01:18:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-01-10 01:18:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 148 states have (on average 1.087837837837838) internal successors, (161), 150 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:18:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2025-01-10 01:18:36,169 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 82 [2025-01-10 01:18:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:36,169 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2025-01-10 01:18:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 68 states have internal predecessors, (132), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:18:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2025-01-10 01:18:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-10 01:18:36,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:36,173 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:36,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:18:36,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:36,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1852204617, now seen corresponding path program 1 times [2025-01-10 01:18:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474850737] [2025-01-10 01:18:36,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:36,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-10 01:18:36,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-10 01:18:36,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:36,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1434 trivial. 0 not checked. [2025-01-10 01:18:36,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:36,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474850737] [2025-01-10 01:18:36,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474850737] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:36,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378195490] [2025-01-10 01:18:36,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:36,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:36,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:36,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:18:36,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:18:36,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-10 01:18:36,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-10 01:18:36,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:36,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:36,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-10 01:18:36,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:18:38,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:18:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378195490] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:40,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:40,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 65, 65] total 132 [2025-01-10 01:18:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838447200] [2025-01-10 01:18:40,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-01-10 01:18:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:40,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-01-10 01:18:40,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4174, Invalid=13118, Unknown=0, NotChecked=0, Total=17292 [2025-01-10 01:18:40,285 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand has 132 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:18:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:43,910 INFO L93 Difference]: Finished difference Result 330 states and 393 transitions. [2025-01-10 01:18:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-01-10 01:18:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2025-01-10 01:18:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:43,911 INFO L225 Difference]: With dead ends: 330 [2025-01-10 01:18:43,912 INFO L226 Difference]: Without dead ends: 270 [2025-01-10 01:18:43,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17613 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12769, Invalid=53023, Unknown=0, NotChecked=0, Total=65792 [2025-01-10 01:18:43,920 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:43,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 317 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:18:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-10 01:18:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2025-01-10 01:18:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 254 states have (on average 1.0590551181102361) internal successors, (269), 256 states have internal predecessors, (269), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:18:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 277 transitions. [2025-01-10 01:18:43,935 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 277 transitions. Word has length 131 [2025-01-10 01:18:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:43,935 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 277 transitions. [2025-01-10 01:18:43,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:18:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 277 transitions. [2025-01-10 01:18:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-10 01:18:43,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:43,937 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:43,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:18:44,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:18:44,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:44,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1415586207, now seen corresponding path program 2 times [2025-01-10 01:18:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396947465] [2025-01-10 01:18:44,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:44,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 232 statements into 2 equivalence classes. [2025-01-10 01:18:44,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 232 of 232 statements. [2025-01-10 01:18:44,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:18:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5960 trivial. 0 not checked. [2025-01-10 01:18:44,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396947465] [2025-01-10 01:18:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396947465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611992660] [2025-01-10 01:18:44,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:44,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:44,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:44,490 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:18:44,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:18:44,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 232 statements into 2 equivalence classes. [2025-01-10 01:18:44,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 232 of 232 statements. [2025-01-10 01:18:44,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:18:44,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:44,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-01-10 01:18:44,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 01:18:48,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 01:18:57,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611992660] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:57,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:57,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 129, 129] total 260 [2025-01-10 01:18:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505723013] [2025-01-10 01:18:57,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:57,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 260 states [2025-01-10 01:18:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:57,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2025-01-10 01:18:57,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16520, Invalid=50820, Unknown=0, NotChecked=0, Total=67340 [2025-01-10 01:18:57,027 INFO L87 Difference]: Start difference. First operand 262 states and 277 transitions. Second operand has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:18:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:57,825 INFO L93 Difference]: Finished difference Result 523 states and 617 transitions. [2025-01-10 01:18:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2025-01-10 01:18:57,826 INFO L78 Accepts]: Start accepts. Automaton has has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 232 [2025-01-10 01:18:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:57,827 INFO L225 Difference]: With dead ends: 523 [2025-01-10 01:18:57,827 INFO L226 Difference]: Without dead ends: 453 [2025-01-10 01:18:57,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19781 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16520, Invalid=50820, Unknown=0, NotChecked=0, Total=67340 [2025-01-10 01:18:57,830 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:57,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 234 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:18:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-01-10 01:18:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-01-10 01:18:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 446 states have (on average 1.031390134529148) internal successors, (460), 447 states have internal predecessors, (460), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:18:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 468 transitions. [2025-01-10 01:18:57,851 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 468 transitions. Word has length 232 [2025-01-10 01:18:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:57,851 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 468 transitions. [2025-01-10 01:18:57,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 260 states, 260 states have (on average 1.623076923076923) internal successors, (422), 260 states have internal predecessors, (422), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:18:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 468 transitions. [2025-01-10 01:18:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-01-10 01:18:57,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:57,857 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:57,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:18:58,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:18:58,062 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:58,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1474476617, now seen corresponding path program 1 times [2025-01-10 01:18:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:58,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526396779] [2025-01-10 01:18:58,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:58,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-01-10 01:18:58,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-01-10 01:18:58,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:58,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24173 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24169 trivial. 0 not checked. [2025-01-10 01:18:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526396779] [2025-01-10 01:18:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526396779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210290814] [2025-01-10 01:18:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:58,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:58,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:58,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:58,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:58,515 INFO L87 Difference]: Start difference. First operand 453 states and 468 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:58,536 INFO L93 Difference]: Finished difference Result 453 states and 468 transitions. [2025-01-10 01:18:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:58,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 424 [2025-01-10 01:18:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:58,539 INFO L225 Difference]: With dead ends: 453 [2025-01-10 01:18:58,539 INFO L226 Difference]: Without dead ends: 452 [2025-01-10 01:18:58,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:58,539 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:58,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-01-10 01:18:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2025-01-10 01:18:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 443 states have (on average 1.0293453724604966) internal successors, (456), 443 states have internal predecessors, (456), 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-01-10 01:18:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 462 transitions. [2025-01-10 01:18:58,555 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 462 transitions. Word has length 424 [2025-01-10 01:18:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:58,556 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 462 transitions. [2025-01-10 01:18:58,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 462 transitions. [2025-01-10 01:18:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-10 01:18:58,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:58,559 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:58,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:18:58,560 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:18:58,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1001564649, now seen corresponding path program 1 times [2025-01-10 01:18:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513228376] [2025-01-10 01:18:58,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:58,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-10 01:18:58,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-10 01:18:58,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:58,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 24173 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24169 trivial. 0 not checked. [2025-01-10 01:18:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513228376] [2025-01-10 01:18:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513228376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171716881] [2025-01-10 01:18:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:58,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:58,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:58,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:58,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:58,980 INFO L87 Difference]: Start difference. First operand 448 states and 462 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:59,005 INFO L93 Difference]: Finished difference Result 448 states and 462 transitions. [2025-01-10 01:18:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:59,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 425 [2025-01-10 01:18:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:59,007 INFO L225 Difference]: With dead ends: 448 [2025-01-10 01:18:59,007 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:18:59,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:59,008 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:59,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:18:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:18:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:18:59,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 425 [2025-01-10 01:18:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:59,010 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:18:59,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:18:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:18:59,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:18:59,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 01:18:59,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 01:18:59,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 01:18:59,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 01:18:59,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 01:18:59,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 01:18:59,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 01:18:59,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 01:18:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:18:59,016 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:59,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:19:00,002 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:19:00,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:19:00 BoogieIcfgContainer [2025-01-10 01:19:00,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:19:00,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:19:00,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:19:00,014 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:19:00,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:29" (3/4) ... [2025-01-10 01:19:00,016 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:19:00,021 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:19:00,023 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 01:19:00,023 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:19:00,023 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:19:00,024 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:19:00,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:19:00,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:19:00,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:19:00,081 INFO L158 Benchmark]: Toolchain (without parser) took 31232.32ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 113.0MB in the beginning and 500.4MB in the end (delta: -387.3MB). Peak memory consumption was 186.5MB. Max. memory is 16.1GB. [2025-01-10 01:19:00,081 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:19:00,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.99ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:19:00,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.31ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:19:00,082 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:19:00,082 INFO L158 Benchmark]: RCFGBuilder took 221.56ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 85.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:19:00,082 INFO L158 Benchmark]: TraceAbstraction took 30716.60ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 85.4MB in the beginning and 504.3MB in the end (delta: -418.9MB). Peak memory consumption was 272.7MB. Max. memory is 16.1GB. [2025-01-10 01:19:00,082 INFO L158 Benchmark]: Witness Printer took 66.43ms. Allocated memory is still 721.4MB. Free memory was 504.3MB in the beginning and 500.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:19:00,083 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.99ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.31ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 221.56ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 85.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30716.60ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 85.4MB in the beginning and 504.3MB in the end (delta: -418.9MB). Peak memory consumption was 272.7MB. Max. memory is 16.1GB. * Witness Printer took 66.43ms. Allocated memory is still 721.4MB. Free memory was 504.3MB in the beginning and 500.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 17, TraceHistogramMax: 127, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 2354 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1824 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1443 IncrementalHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 530 mSDtfsCounter, 1443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1381 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 711 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39618 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=15, InterpolantAutomatonStates: 556, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 37 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 2157 NumberOfCodeBlocks, 2112 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2670 ConstructedInterpolants, 0 QuantifiedInterpolants, 4640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3527 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 56516/72079 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((i == 0) && (j == 0)) || ((i == 0) && (1 <= j))) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((0 < x) || (x == 0)) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((0 < x) || (x == 0)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:19:00,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE