./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/max-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/max-3-n-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:51:10,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:51:10,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:51:10,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:51:10,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:51:10,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:51:10,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:51:10,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:51:10,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:51:10,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:51:10,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:51:10,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:51:10,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:51:10,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:51:10,190 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:51:10,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:51:10,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:51:10,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:51:10,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:51:10,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:10,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:51:10,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:51:10,192 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 -> 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 [2025-02-08 08:51:10,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:51:10,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:51:10,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:51:10,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:51:10,467 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:51:10,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2025-02-08 08:51:11,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbcbccf0a/481639513b154302b47f9e934845c39f/FLAG508784f89 [2025-02-08 08:51:11,876 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:51:11,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2025-02-08 08:51:11,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbcbccf0a/481639513b154302b47f9e934845c39f/FLAG508784f89 [2025-02-08 08:51:12,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbcbccf0a/481639513b154302b47f9e934845c39f [2025-02-08 08:51:12,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:51:12,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:51:12,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:12,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:51:12,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:51:12,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c299b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12, skipping insertion in model container [2025-02-08 08:51:12,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:51:12,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:12,311 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:51:12,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:51:12,338 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:51:12,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12 WrapperNode [2025-02-08 08:51:12,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:51:12,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:12,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:51:12,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:51:12,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,366 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2025-02-08 08:51:12,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:51:12,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:51:12,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:51:12,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:51:12,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,393 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 08:51:12,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:51:12,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:51:12,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:51:12,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:51:12,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (1/1) ... [2025-02-08 08:51:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:51:12,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:12,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:51:12,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:51:12,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:51:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:51:12,552 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:51:12,558 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:51:12,761 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: assume 1 + main_~k~0#1 <= 2147483647;main_~k~0#1 := 1 + main_~k~0#1; [2025-02-08 08:51:12,761 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: assume !(1 + main_~k~0#1 <= 2147483647); [2025-02-08 08:51:12,761 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: assume 1 + main_~k~0#1 >= -2147483648; [2025-02-08 08:51:12,761 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: assume !(1 + main_~k~0#1 >= -2147483648); [2025-02-08 08:51:12,762 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-02-08 08:51:12,762 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L72: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem8#1; [2025-02-08 08:51:12,773 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-02-08 08:51:12,773 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:51:12,785 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:51:12,785 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:51:12,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:12 BoogieIcfgContainer [2025-02-08 08:51:12,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:51:12,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:51:12,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:51:12,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:51:12,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:51:12" (1/3) ... [2025-02-08 08:51:12,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4c0200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:12, skipping insertion in model container [2025-02-08 08:51:12,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:51:12" (2/3) ... [2025-02-08 08:51:12,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4c0200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:51:12, skipping insertion in model container [2025-02-08 08:51:12,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:12" (3/3) ... [2025-02-08 08:51:12,801 INFO L128 eAbstractionObserver]: Analyzing ICFG max-3-n-u.c [2025-02-08 08:51:12,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:51:12,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max-3-n-u.c that has 1 procedures, 48 locations, 1 initial locations, 9 loop locations, and 18 error locations. [2025-02-08 08:51:12,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:51:12,870 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;@105c6086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:51:12,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 08:51:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.9) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:51:12,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:12,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:51:12,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:12,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2861876, now seen corresponding path program 1 times [2025-02-08 08:51:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:12,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223422600] [2025-02-08 08:51:12,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:12,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:12,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:51:12,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:51:12,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:12,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223422600] [2025-02-08 08:51:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223422600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:51:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12467497] [2025-02-08 08:51:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:13,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:13,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:13,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:13,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:13,088 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.9) internal successors, (57), 47 states have internal predecessors, (57), 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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-02-08 08:51:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:13,164 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2025-02-08 08:51:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:13,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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-02-08 08:51:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:13,170 INFO L225 Difference]: With dead ends: 116 [2025-02-08 08:51:13,170 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 08:51:13,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:13,174 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 72 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:13,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 71 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 08:51:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2025-02-08 08:51:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 59 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-02-08 08:51:13,199 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 4 [2025-02-08 08:51:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:13,199 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-02-08 08:51:13,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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-02-08 08:51:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-02-08 08:51:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 08:51:13,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:13,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:51:13,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:51:13,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash 88717531, now seen corresponding path program 1 times [2025-02-08 08:51:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293596559] [2025-02-08 08:51:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:13,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:51:13,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:51:13,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293596559] [2025-02-08 08:51:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293596559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:13,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:51:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282758212] [2025-02-08 08:51:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:13,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:13,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:13,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:13,260 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:13,310 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2025-02-08 08:51:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:13,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 08:51:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:13,311 INFO L225 Difference]: With dead ends: 78 [2025-02-08 08:51:13,312 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 08:51:13,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:13,313 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:13,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 75 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 08:51:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 08:51:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.6379310344827587) internal successors, (95), 73 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2025-02-08 08:51:13,325 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 5 [2025-02-08 08:51:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2025-02-08 08:51:13,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2025-02-08 08:51:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:51:13,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:13,326 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:13,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:51:13,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:13,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1579102939, now seen corresponding path program 1 times [2025-02-08 08:51:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:13,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382494693] [2025-02-08 08:51:13,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:13,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:51:13,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:51:13,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382494693] [2025-02-08 08:51:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382494693] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553762666] [2025-02-08 08:51:13,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:13,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:13,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:51:13,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:51:13,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:51:13,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:13,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:13,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:51:13,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553762666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:51:13,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 08:51:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226111523] [2025-02-08 08:51:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:13,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:13,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:51:13,580 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:13,641 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2025-02-08 08:51:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:51:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:13,642 INFO L225 Difference]: With dead ends: 74 [2025-02-08 08:51:13,644 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 08:51:13,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:51:13,645 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:13,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 08:51:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-08 08:51:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 71 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2025-02-08 08:51:13,651 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 8 [2025-02-08 08:51:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:13,652 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2025-02-08 08:51:13,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2025-02-08 08:51:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:51:13,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:13,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:13,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:51:13,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:13,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:13,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1579903537, now seen corresponding path program 1 times [2025-02-08 08:51:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:13,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249350390] [2025-02-08 08:51:13,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:13,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:51:13,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:51:13,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:13,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249350390] [2025-02-08 08:51:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249350390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:13,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:13,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:51:13,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378955507] [2025-02-08 08:51:13,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:13,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:51:13,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:13,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:51:13,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:13,919 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 4 states, 4 states have (on average 2.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-02-08 08:51:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:13,951 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2025-02-08 08:51:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:13,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.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-02-08 08:51:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:13,952 INFO L225 Difference]: With dead ends: 131 [2025-02-08 08:51:13,952 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 08:51:13,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:51:13,953 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:13,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 54 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 08:51:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 08:51:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-02-08 08:51:13,958 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 8 [2025-02-08 08:51:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:13,958 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-02-08 08:51:13,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.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-02-08 08:51:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-02-08 08:51:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 08:51:13,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:13,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-08 08:51:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:51:13,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:13,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1707550877, now seen corresponding path program 1 times [2025-02-08 08:51:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:13,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227418783] [2025-02-08 08:51:13,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:13,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:51:13,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:51:13,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:13,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:14,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227418783] [2025-02-08 08:51:14,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227418783] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493403184] [2025-02-08 08:51:14,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:14,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:14,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:14,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:14,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:51:14,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:51:14,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:51:14,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:14,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:14,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:14,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:51:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493403184] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:14,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 08:51:14,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461244733] [2025-02-08 08:51:14,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:14,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:51:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:14,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:51:14,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:14,137 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:14,236 INFO L93 Difference]: Finished difference Result 101 states and 142 transitions. [2025-02-08 08:51:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:51:14,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 9 [2025-02-08 08:51:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:14,239 INFO L225 Difference]: With dead ends: 101 [2025-02-08 08:51:14,239 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 08:51:14,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:51:14,239 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:14,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 08:51:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 08:51:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 98 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2025-02-08 08:51:14,259 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 9 [2025-02-08 08:51:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:14,259 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2025-02-08 08:51:14,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2025-02-08 08:51:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:51:14,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:14,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:14,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:14,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:14,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:14,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash 279687217, now seen corresponding path program 1 times [2025-02-08 08:51:14,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871415427] [2025-02-08 08:51:14,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:14,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:51:14,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:51:14,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:14,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871415427] [2025-02-08 08:51:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871415427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:14,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:51:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033129140] [2025-02-08 08:51:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:14,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:14,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:14,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:14,514 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-02-08 08:51:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:14,544 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2025-02-08 08:51:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-02-08 08:51:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:14,545 INFO L225 Difference]: With dead ends: 99 [2025-02-08 08:51:14,545 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 08:51:14,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:14,546 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:14,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 08:51:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 08:51:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 96 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-02-08 08:51:14,561 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 11 [2025-02-08 08:51:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:14,561 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-02-08 08:51:14,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-02-08 08:51:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2025-02-08 08:51:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:51:14,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:14,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:14,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:51:14,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:14,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash 80369151, now seen corresponding path program 1 times [2025-02-08 08:51:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433152206] [2025-02-08 08:51:14,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:14,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:51:14,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:51:14,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:14,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433152206] [2025-02-08 08:51:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433152206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:51:14,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:51:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:51:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61032020] [2025-02-08 08:51:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:51:14,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:51:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:14,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:51:14,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:14,611 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:14,654 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2025-02-08 08:51:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:51:14,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2025-02-08 08:51:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:14,655 INFO L225 Difference]: With dead ends: 193 [2025-02-08 08:51:14,655 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 08:51:14,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:51:14,656 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:14,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 45 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 08:51:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2025-02-08 08:51:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 177 states have (on average 1.4293785310734464) internal successors, (253), 184 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 253 transitions. [2025-02-08 08:51:14,672 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 253 transitions. Word has length 12 [2025-02-08 08:51:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:14,672 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 253 transitions. [2025-02-08 08:51:14,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 253 transitions. [2025-02-08 08:51:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:51:14,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:14,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 08:51:14,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:51:14,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1961521523, now seen corresponding path program 1 times [2025-02-08 08:51:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:14,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820568495] [2025-02-08 08:51:14,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:14,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:14,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:14,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:14,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820568495] [2025-02-08 08:51:14,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820568495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92261208] [2025-02-08 08:51:14,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:14,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:14,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:14,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:51:14,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:51:14,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:51:14,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:14,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:14,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:51:14,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:14,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:51:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92261208] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:14,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:14,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2025-02-08 08:51:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279620834] [2025-02-08 08:51:14,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:14,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:51:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:14,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:51:14,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:51:14,832 INFO L87 Difference]: Start difference. First operand 185 states and 253 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:15,067 INFO L93 Difference]: Finished difference Result 352 states and 482 transitions. [2025-02-08 08:51:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:51:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 15 [2025-02-08 08:51:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:15,068 INFO L225 Difference]: With dead ends: 352 [2025-02-08 08:51:15,068 INFO L226 Difference]: Without dead ends: 185 [2025-02-08 08:51:15,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:51:15,069 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 237 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:15,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 63 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:51:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-08 08:51:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2025-02-08 08:51:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 177 states have (on average 1.271186440677966) internal successors, (225), 182 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 225 transitions. [2025-02-08 08:51:15,081 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 225 transitions. Word has length 15 [2025-02-08 08:51:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:15,081 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 225 transitions. [2025-02-08 08:51:15,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 225 transitions. [2025-02-08 08:51:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 08:51:15,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:15,081 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-02-08 08:51:15,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:51:15,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:15,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:15,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1610736285, now seen corresponding path program 2 times [2025-02-08 08:51:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545935860] [2025-02-08 08:51:15,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:15,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:15,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 08:51:15,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-08 08:51:15,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:15,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:15,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:15,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545935860] [2025-02-08 08:51:15,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545935860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:15,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100075404] [2025-02-08 08:51:15,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:15,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:15,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:51:15,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 08:51:15,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-08 08:51:15,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:15,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:15,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:15,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:51:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100075404] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:15,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:15,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:51:15,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373922152] [2025-02-08 08:51:15,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:15,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:15,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:15,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:15,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:15,446 INFO L87 Difference]: Start difference. First operand 183 states and 225 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:15,488 INFO L93 Difference]: Finished difference Result 183 states and 225 transitions. [2025-02-08 08:51:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:51:15,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2025-02-08 08:51:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:15,490 INFO L225 Difference]: With dead ends: 183 [2025-02-08 08:51:15,490 INFO L226 Difference]: Without dead ends: 181 [2025-02-08 08:51:15,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:51:15,490 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:15,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-08 08:51:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2025-02-08 08:51:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.2292993630573248) internal successors, (193), 160 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 193 transitions. [2025-02-08 08:51:15,499 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 193 transitions. Word has length 18 [2025-02-08 08:51:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:15,499 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 193 transitions. [2025-02-08 08:51:15,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 193 transitions. [2025-02-08 08:51:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 08:51:15,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:15,500 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 08:51:15,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:51:15,701 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,SelfDestructingSolverStorable8 [2025-02-08 08:51:15,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:15,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2106172955, now seen corresponding path program 1 times [2025-02-08 08:51:15,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:15,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966846426] [2025-02-08 08:51:15,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:15,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 08:51:15,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:51:15,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:15,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 08:51:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:15,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966846426] [2025-02-08 08:51:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966846426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580259332] [2025-02-08 08:51:15,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:15,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:15,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:15,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:15,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:51:15,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 08:51:15,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:51:15,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:15,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:51:15,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 08:51:15,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 08:51:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580259332] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:15,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:15,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 16 [2025-02-08 08:51:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176850698] [2025-02-08 08:51:15,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:51:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:15,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:51:15,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:51:15,993 INFO L87 Difference]: Start difference. First operand 161 states and 193 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:16,494 INFO L93 Difference]: Finished difference Result 630 states and 820 transitions. [2025-02-08 08:51:16,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-08 08:51:16,494 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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 34 [2025-02-08 08:51:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:16,515 INFO L225 Difference]: With dead ends: 630 [2025-02-08 08:51:16,515 INFO L226 Difference]: Without dead ends: 485 [2025-02-08 08:51:16,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 08:51:16,516 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 805 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:16,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 62 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:51:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-02-08 08:51:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-02-08 08:51:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 481 states have (on average 1.182952182952183) internal successors, (569), 484 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 569 transitions. [2025-02-08 08:51:16,560 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 569 transitions. Word has length 34 [2025-02-08 08:51:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:16,560 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 569 transitions. [2025-02-08 08:51:16,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 569 transitions. [2025-02-08 08:51:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-08 08:51:16,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:16,563 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-02-08 08:51:16,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:51:16,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 08:51:16,768 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:16,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:16,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1465155681, now seen corresponding path program 1 times [2025-02-08 08:51:16,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:16,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84100881] [2025-02-08 08:51:16,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:16,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 08:51:16,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 08:51:16,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-02-08 08:51:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:17,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84100881] [2025-02-08 08:51:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84100881] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:17,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961211567] [2025-02-08 08:51:17,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:51:17,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:17,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:17,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:17,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:51:17,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 08:51:17,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 08:51:17,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:51:17,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:17,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:51:17,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-08 08:51:17,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-08 08:51:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961211567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:17,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 13, 13] total 27 [2025-02-08 08:51:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651675695] [2025-02-08 08:51:17,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 08:51:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:17,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 08:51:17,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=448, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:51:17,477 INFO L87 Difference]: Start difference. First operand 485 states and 569 transitions. Second operand has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:18,955 INFO L93 Difference]: Finished difference Result 1936 states and 2467 transitions. [2025-02-08 08:51:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-02-08 08:51:18,956 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 27 states have internal predecessors, (103), 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 77 [2025-02-08 08:51:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:18,960 INFO L225 Difference]: With dead ends: 1936 [2025-02-08 08:51:18,960 INFO L226 Difference]: Without dead ends: 1485 [2025-02-08 08:51:18,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2509, Invalid=4631, Unknown=0, NotChecked=0, Total=7140 [2025-02-08 08:51:18,964 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1996 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:18,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1996 Valid, 77 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 08:51:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2025-02-08 08:51:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1481. [2025-02-08 08:51:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1477 states have (on average 1.1618144888287067) internal successors, (1716), 1480 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1716 transitions. [2025-02-08 08:51:19,041 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1716 transitions. Word has length 77 [2025-02-08 08:51:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:19,041 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 1716 transitions. [2025-02-08 08:51:19,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 27 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1716 transitions. [2025-02-08 08:51:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 08:51:19,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:19,045 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 3, 3, 3, 2, 1, 1, 1] [2025-02-08 08:51:19,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:51:19,246 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,SelfDestructingSolverStorable10 [2025-02-08 08:51:19,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:19,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash -677819112, now seen corresponding path program 2 times [2025-02-08 08:51:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:19,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879867272] [2025-02-08 08:51:19,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:19,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:19,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-02-08 08:51:19,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 212 statements. [2025-02-08 08:51:19,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:19,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6645 backedges. 0 proven. 2998 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2025-02-08 08:51:19,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:19,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879867272] [2025-02-08 08:51:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879867272] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:19,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660555146] [2025-02-08 08:51:19,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:19,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:19,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:19,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:19,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:51:19,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-02-08 08:51:19,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 212 statements. [2025-02-08 08:51:19,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:19,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:19,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:19,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6645 backedges. 0 proven. 2998 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2025-02-08 08:51:19,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6645 backedges. 0 proven. 2998 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2025-02-08 08:51:19,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660555146] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:19,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:19,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:51:19,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252968834] [2025-02-08 08:51:19,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:19,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:19,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:19,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:19,820 INFO L87 Difference]: Start difference. First operand 1481 states and 1716 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:19,922 INFO L93 Difference]: Finished difference Result 1481 states and 1716 transitions. [2025-02-08 08:51:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:51:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 212 [2025-02-08 08:51:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:19,927 INFO L225 Difference]: With dead ends: 1481 [2025-02-08 08:51:19,927 INFO L226 Difference]: Without dead ends: 1479 [2025-02-08 08:51:19,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:51:19,928 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:19,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2025-02-08 08:51:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 513. [2025-02-08 08:51:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 511 states have (on average 1.162426614481409) internal successors, (594), 512 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 594 transitions. [2025-02-08 08:51:19,952 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 594 transitions. Word has length 212 [2025-02-08 08:51:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:19,953 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 594 transitions. [2025-02-08 08:51:19,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 594 transitions. [2025-02-08 08:51:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-08 08:51:19,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:51:19,955 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2025-02-08 08:51:19,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 08:51:20,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:20,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-02-08 08:51:20,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:51:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash 354695999, now seen corresponding path program 2 times [2025-02-08 08:51:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:51:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272433388] [2025-02-08 08:51:20,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:51:20,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 223 statements into 2 equivalence classes. [2025-02-08 08:51:20,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 223 statements. [2025-02-08 08:51:20,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:20,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6666 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 3656 trivial. 0 not checked. [2025-02-08 08:51:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:51:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272433388] [2025-02-08 08:51:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272433388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:51:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178698460] [2025-02-08 08:51:20,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:51:20,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:20,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:51:20,214 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:51:20,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:51:20,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 223 statements into 2 equivalence classes. [2025-02-08 08:51:20,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 223 statements. [2025-02-08 08:51:20,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:51:20,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:51:20,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:51:20,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:51:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6666 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 3656 trivial. 0 not checked. [2025-02-08 08:51:20,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:51:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6666 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 3656 trivial. 0 not checked. [2025-02-08 08:51:20,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178698460] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:51:20,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:51:20,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:51:20,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425546235] [2025-02-08 08:51:20,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:51:20,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:51:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:51:20,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:51:20,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:51:20,695 INFO L87 Difference]: Start difference. First operand 513 states and 594 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:51:20,758 INFO L93 Difference]: Finished difference Result 513 states and 594 transitions. [2025-02-08 08:51:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:51:20,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 223 [2025-02-08 08:51:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:51:20,759 INFO L225 Difference]: With dead ends: 513 [2025-02-08 08:51:20,759 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:51:20,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:51:20,760 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:51:20,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 16 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:51:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:51:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:51:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:51:20,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2025-02-08 08:51:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:51:20,761 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:51:20,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:51:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:51:20,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:51:20,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-02-08 08:51:20,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-02-08 08:51:20,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-02-08 08:51:20,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-02-08 08:51:20,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-02-08 08:51:20,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-02-08 08:51:20,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:51:20,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:51:20,967 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:51:20,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:51:23,763 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:51:23,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:51:23 BoogieIcfgContainer [2025-02-08 08:51:23,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:51:23,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:51:23,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:51:23,776 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:51:23,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:51:12" (3/4) ... [2025-02-08 08:51:23,778 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:51:23,792 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 08:51:23,793 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:51:23,793 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:51:23,793 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:51:23,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:51:23,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:51:23,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:51:23,860 INFO L158 Benchmark]: Toolchain (without parser) took 11692.04ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 114.9MB in the beginning and 227.0MB in the end (delta: -112.1MB). Peak memory consumption was 298.6MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,860 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:23,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.38ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 103.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.16ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 101.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:51:23,860 INFO L158 Benchmark]: Boogie Preprocessor took 44.08ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 982.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,869 INFO L158 Benchmark]: IcfgBuilder took 375.86ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 85.1MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,869 INFO L158 Benchmark]: TraceAbstraction took 10986.83ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 84.2MB in the beginning and 235.1MB in the end (delta: -151.0MB). Peak memory consumption was 295.9MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,869 INFO L158 Benchmark]: Witness Printer took 83.32ms. Allocated memory is still 553.6MB. Free memory was 235.1MB in the beginning and 227.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:51:23,870 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.31ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.38ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 103.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.16ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 101.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.08ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 982.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 375.86ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 85.1MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10986.83ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 84.2MB in the beginning and 235.1MB in the end (delta: -151.0MB). Peak memory consumption was 295.9MB. Max. memory is 16.1GB. * Witness Printer took 83.32ms. Allocated memory is still 553.6MB. Free memory was 235.1MB in the beginning and 227.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. 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: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: 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 1 procedures, 48 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 13, TraceHistogramMax: 66, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3362 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3362 mSDsluCounter, 697 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 382 mSDsCounter, 468 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 796 IncrementalHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 468 mSolverCounterUnsat, 315 mSDtfsCounter, 796 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1299 GetRequests, 1124 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2674 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1481occurred in iteration=11, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1002 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 5352 SizeOfPredicates, 6 NumberOfNonLiveVariables, 852 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 23456/42249 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 18 specifications checked. All of them hold - InvariantResult [Line: 66]: Location Invariant Derived location invariant: ((1500 <= n) && (1800 <= p)) - InvariantResult [Line: 30]: Location Invariant Derived location invariant: ((((m <= 1000) && (i <= 999)) && ((((((k == 0) && (p == 1800)) && (0 <= i)) && (j == 0)) && (n == 1500)) || ((((((1 <= j) && (k == 0)) && (p == 1800)) && (0 <= i)) && (n == 1500)) && (j <= 1499)))) || (((m <= 1000) && (((((((p == 1800) && (0 <= i)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500)) || (((((((1 <= j) && (p == 1800)) && (0 <= i)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)))) && (i <= 999))) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: (((((m <= 1000) && (i <= 2147483646)) && (p == 1800)) && (0 <= i)) && (n == 1500)) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: ((((((((m <= 1000) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (0 <= i)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i <= 999)) && (p == 1800)) && (0 <= i)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 71]: Location Invariant Derived location invariant: ((((1500 <= n) && (1800 <= p)) && (k == 0)) && (j == 0)) - InvariantResult [Line: 45]: Location Invariant Derived location invariant: (((((m <= 1000) && (i <= 2147483646)) && (p == 1800)) && (0 <= i)) && (n == 1500)) - InvariantResult [Line: 69]: Location Invariant Derived location invariant: (((1500 <= n) && (1800 <= p)) && (j == 0)) - InvariantResult [Line: 50]: Location Invariant Derived location invariant: ((((m <= 1000) && (i <= 999)) && ((((((k == 0) && (p == 1800)) && (0 <= i)) && (j == 0)) && (n == 1500)) || ((((((1 <= j) && (k == 0)) && (p == 1800)) && (0 <= i)) && (n == 1500)) && (j <= 1499)))) || (((m <= 1000) && (((((((p == 1800) && (0 <= i)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500)) || (((((((1 <= j) && (p == 1800)) && (0 <= i)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)))) && (i <= 999))) - InvariantResult [Line: 48]: Location Invariant Derived location invariant: ((((((((m <= 1000) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (0 <= i)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i <= 999)) && (p == 1800)) && (0 <= i)) && (j == 0)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:51:23,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE