./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-fpi/condnf.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condnf.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 f71f01dc38efbcea276a0ff799d485cde0ac6c564de665d7efc24977838eb82a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:21:59,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:21:59,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:21:59,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:21:59,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:21:59,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:21:59,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:21:59,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:21:59,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:21:59,547 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:21:59,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:21:59,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:21:59,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:21:59,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:21:59,547 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:21:59,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:21:59,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:21:59,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:21:59,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:59,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:21:59,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:59,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:21:59,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:21:59,549 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 -> f71f01dc38efbcea276a0ff799d485cde0ac6c564de665d7efc24977838eb82a [2025-01-10 01:21:59,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:21:59,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:21:59,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:21:59,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:21:59,790 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:21:59,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condnf.c [2025-01-10 01:22:00,934 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c22e85e3f/7489778ffe444d96b57f49f3cd0971b5/FLAG64253ac5c [2025-01-10 01:22:01,226 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:22:01,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c [2025-01-10 01:22:01,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c22e85e3f/7489778ffe444d96b57f49f3cd0971b5/FLAG64253ac5c [2025-01-10 01:22:01,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c22e85e3f/7489778ffe444d96b57f49f3cd0971b5 [2025-01-10 01:22:01,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:22:01,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:22:01,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:22:01,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:22:01,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:22:01,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2d7d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01, skipping insertion in model container [2025-01-10 01:22:01,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:22:01,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:22:01,650 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:22:01,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:22:01,674 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:22:01,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01 WrapperNode [2025-01-10 01:22:01,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:22:01,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:22:01,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:22:01,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:22:01,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,703 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-01-10 01:22:01,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:22:01,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:22:01,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:22:01,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:22:01,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,734 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-10 01:22:01,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:22:01,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:22:01,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:22:01,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:22:01,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (1/1) ... [2025-01-10 01:22:01,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:22:01,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:01,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:22:01,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:22:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:22:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:22:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:22:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:22:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:22:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:22:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:22:01,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:22:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:22:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:22:01,886 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:22:01,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:22:01,986 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-10 01:22:01,987 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:22:01,996 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:22:01,996 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:22:01,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:01 BoogieIcfgContainer [2025-01-10 01:22:01,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:22:01,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:22:01,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:22:02,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:22:02,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:22:01" (1/3) ... [2025-01-10 01:22:02,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ecb35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:22:02, skipping insertion in model container [2025-01-10 01:22:02,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:22:01" (2/3) ... [2025-01-10 01:22:02,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ecb35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:22:02, skipping insertion in model container [2025-01-10 01:22:02,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:01" (3/3) ... [2025-01-10 01:22:02,002 INFO L128 eAbstractionObserver]: Analyzing ICFG condnf.c [2025-01-10 01:22:02,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:22:02,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG condnf.c that has 1 procedures, 29 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-01-10 01:22:02,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:22:02,046 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;@2b56fbd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:22:02,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:22:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:22:02,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:02,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:02,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:02,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1806845225, now seen corresponding path program 1 times [2025-01-10 01:22:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:02,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793261202] [2025-01-10 01:22:02,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:02,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:22:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:22:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:02,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:02,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793261202] [2025-01-10 01:22:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793261202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:22:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819879357] [2025-01-10 01:22:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:02,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:22:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:02,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:22:02,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:22:02,181 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:02,191 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-01-10 01:22:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:22:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:22:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:02,197 INFO L225 Difference]: With dead ends: 53 [2025-01-10 01:22:02,197 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:22:02,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:22:02,201 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:02,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:22:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-10 01:22:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-01-10 01:22:02,225 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2025-01-10 01:22:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:02,225 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-01-10 01:22:02,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-01-10 01:22:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:22:02,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:02,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:02,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:22:02,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:02,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1806904807, now seen corresponding path program 1 times [2025-01-10 01:22:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617101031] [2025-01-10 01:22:02,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:02,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:22:02,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:22:02,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:02,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:02,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:02,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617101031] [2025-01-10 01:22:02,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617101031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:02,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:02,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:22:02,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104176113] [2025-01-10 01:22:02,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:02,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:02,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:02,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:02,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:02,347 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:02,410 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-01-10 01:22:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:22:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:02,411 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:22:02,411 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:22:02,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:02,412 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:02,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:22:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:22:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2025-01-10 01:22:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-01-10 01:22:02,417 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2025-01-10 01:22:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:02,417 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-01-10 01:22:02,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-01-10 01:22:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:22:02,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:02,417 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:22:02,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:02,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 676036079, now seen corresponding path program 1 times [2025-01-10 01:22:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481250968] [2025-01-10 01:22:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:02,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:02,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:02,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:02,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481250968] [2025-01-10 01:22:02,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481250968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175241661] [2025-01-10 01:22:02,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:02,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:02,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:02,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:22:02,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:02,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:02,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:02,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:02,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:02,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:02,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:22:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175241661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:02,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:22:02,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:22:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768980391] [2025-01-10 01:22:02,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:02,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:22:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:02,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:22:02,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:02,676 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:02,755 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-01-10 01:22:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:22:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:22:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:02,756 INFO L225 Difference]: With dead ends: 33 [2025-01-10 01:22:02,756 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:22:02,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:22:02,757 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:02,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:22:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:22:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-01-10 01:22:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-01-10 01:22:02,767 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 10 [2025-01-10 01:22:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:02,767 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-01-10 01:22:02,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-01-10 01:22:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:22:02,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:02,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:02,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:22:02,968 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-01-10 01:22:02,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash 681826648, now seen corresponding path program 1 times [2025-01-10 01:22:02,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:02,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028887860] [2025-01-10 01:22:02,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:02,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:02,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:22:03,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:22:03,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:03,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028887860] [2025-01-10 01:22:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028887860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:03,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:03,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:22:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918770718] [2025-01-10 01:22:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:03,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:03,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:03,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:03,073 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:03,109 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-01-10 01:22:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:03,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:22:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:03,110 INFO L225 Difference]: With dead ends: 46 [2025-01-10 01:22:03,110 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:22:03,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-10 01:22:03,111 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:03,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:22:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-01-10 01:22:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-01-10 01:22:03,115 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2025-01-10 01:22:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:03,115 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-01-10 01:22:03,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-01-10 01:22:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:22:03,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:03,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:03,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:22:03,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:03,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:03,117 INFO L85 PathProgramCache]: Analyzing trace with hash -517717979, now seen corresponding path program 1 times [2025-01-10 01:22:03,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:03,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872852466] [2025-01-10 01:22:03,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:03,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:03,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:22:03,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:22:03,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:03,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:03,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:03,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872852466] [2025-01-10 01:22:03,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872852466] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:03,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13554132] [2025-01-10 01:22:03,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:03,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:03,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:03,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:03,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:22:03,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:22:03,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:22:03,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:03,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:03,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:03,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:03,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:03,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13554132] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:03,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:03,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:22:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438892712] [2025-01-10 01:22:03,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:03,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:22:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:03,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:22:03,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:22:03,342 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:03,412 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2025-01-10 01:22:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:22:03,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:22:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:03,413 INFO L225 Difference]: With dead ends: 42 [2025-01-10 01:22:03,413 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 01:22:03,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:22:03,414 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:03,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 69 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:22:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 01:22:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-01-10 01:22:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-01-10 01:22:03,420 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2025-01-10 01:22:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:03,421 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-10 01:22:03,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-01-10 01:22:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:22:03,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:03,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:03,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:22:03,621 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-01-10 01:22:03,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:03,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 695020624, now seen corresponding path program 1 times [2025-01-10 01:22:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:03,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402758286] [2025-01-10 01:22:03,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:03,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:03,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:22:03,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:22:03,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:03,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:22:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402758286] [2025-01-10 01:22:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402758286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:03,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:03,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:22:03,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744069208] [2025-01-10 01:22:03,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:03,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:03,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:03,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:03,679 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:03,715 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-01-10 01:22:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:03,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-01-10 01:22:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:03,716 INFO L225 Difference]: With dead ends: 45 [2025-01-10 01:22:03,716 INFO L226 Difference]: Without dead ends: 43 [2025-01-10 01:22:03,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:03,717 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:03,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-10 01:22:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2025-01-10 01:22:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-01-10 01:22:03,722 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 13 [2025-01-10 01:22:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:03,722 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-01-10 01:22:03,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-01-10 01:22:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:22:03,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:03,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:03,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:22:03,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:03,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1415163292, now seen corresponding path program 1 times [2025-01-10 01:22:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85988171] [2025-01-10 01:22:03,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:03,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:22:03,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:22:03,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:03,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:22:03,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85988171] [2025-01-10 01:22:03,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85988171] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945845702] [2025-01-10 01:22:03,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:03,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:03,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:03,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:03,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:22:03,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:22:03,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:22:03,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:03,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:03,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:22:03,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:03,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:22:03,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945845702] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:03,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:03,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-01-10 01:22:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982698922] [2025-01-10 01:22:03,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:03,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:22:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:03,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:22:03,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:22:03,973 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:04,126 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2025-01-10 01:22:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:22:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-01-10 01:22:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:04,127 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:22:04,127 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 01:22:04,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:22:04,128 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:04,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 91 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:22:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 01:22:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-01-10 01:22:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-01-10 01:22:04,136 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 18 [2025-01-10 01:22:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:04,136 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-01-10 01:22:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-01-10 01:22:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:22:04,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:04,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:04,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:22:04,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:04,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:04,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 932771293, now seen corresponding path program 1 times [2025-01-10 01:22:04,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:04,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872206248] [2025-01-10 01:22:04,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:04,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:22:04,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:22:04,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:04,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:22:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872206248] [2025-01-10 01:22:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872206248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:22:04,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:22:04,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:22:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766615212] [2025-01-10 01:22:04,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:22:04,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:04,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:04,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:04,383 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:04,409 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-01-10 01:22:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:04,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-01-10 01:22:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:04,410 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:22:04,410 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:22:04,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:04,411 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:04,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:04,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:22:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 01:22:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-10 01:22:04,414 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 19 [2025-01-10 01:22:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:04,414 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-10 01:22:04,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-01-10 01:22:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:22:04,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:04,415 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:04,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:22:04,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:04,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash -57259731, now seen corresponding path program 2 times [2025-01-10 01:22:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886300119] [2025-01-10 01:22:04,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:04,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:04,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:22:04,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-01-10 01:22:04,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:04,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:22:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886300119] [2025-01-10 01:22:04,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886300119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183603637] [2025-01-10 01:22:04,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:04,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:04,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:04,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:04,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:22:04,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:22:04,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-01-10 01:22:04,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:04,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:04,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:22:04,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:22:04,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:22:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183603637] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:04,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-10 01:22:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688888859] [2025-01-10 01:22:04,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:04,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:22:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:22:04,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:22:04,656 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:04,697 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-01-10 01:22:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:22:04,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 20 [2025-01-10 01:22:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:04,701 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:22:04,701 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 01:22:04,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:22:04,701 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:04,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 25 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 01:22:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-01-10 01:22:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-01-10 01:22:04,707 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2025-01-10 01:22:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:04,707 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-01-10 01:22:04,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-01-10 01:22:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:22:04,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:04,708 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:04,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:22:04,908 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-01-10 01:22:04,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:04,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash 898927153, now seen corresponding path program 1 times [2025-01-10 01:22:04,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:04,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285871292] [2025-01-10 01:22:04,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:04,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:22:04,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:22:04,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:04,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:22:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285871292] [2025-01-10 01:22:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285871292] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416463308] [2025-01-10 01:22:04,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:04,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:04,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:04,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:04,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:22:05,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:22:05,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:22:05,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:05,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:05,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:22:05,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:22:05,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:22:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416463308] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:05,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:22:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961399041] [2025-01-10 01:22:05,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:05,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:22:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:05,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:22:05,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:22:05,119 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:05,213 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-01-10 01:22:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:22:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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 22 [2025-01-10 01:22:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:05,214 INFO L225 Difference]: With dead ends: 57 [2025-01-10 01:22:05,214 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 01:22:05,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:22:05,215 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:05,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 68 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:22:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 01:22:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 01:22:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-01-10 01:22:05,218 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2025-01-10 01:22:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:05,218 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-01-10 01:22:05,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-01-10 01:22:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:22:05,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:05,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:05,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:22:05,419 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-01-10 01:22:05,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:05,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1492045192, now seen corresponding path program 1 times [2025-01-10 01:22:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:05,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360997020] [2025-01-10 01:22:05,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:05,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:22:05,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:22:05,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:05,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:22:05,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:05,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360997020] [2025-01-10 01:22:05,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360997020] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:05,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632714777] [2025-01-10 01:22:05,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:05,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:05,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:05,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:05,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:22:05,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:22:05,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:22:05,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:05,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:05,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:22:05,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:22:05,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:22:05,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632714777] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:05,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:05,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2025-01-10 01:22:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368474337] [2025-01-10 01:22:05,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:05,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:22:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:05,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:22:05,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:22:05,650 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:05,784 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2025-01-10 01:22:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:22:05,784 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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 24 [2025-01-10 01:22:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:05,785 INFO L225 Difference]: With dead ends: 71 [2025-01-10 01:22:05,785 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:22:05,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:22:05,785 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:05,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:22:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:22:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2025-01-10 01:22:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-01-10 01:22:05,792 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 24 [2025-01-10 01:22:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:05,792 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-01-10 01:22:05,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-01-10 01:22:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:22:05,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:05,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:05,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:22:05,993 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-01-10 01:22:05,993 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:05,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 929186266, now seen corresponding path program 1 times [2025-01-10 01:22:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:05,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363471639] [2025-01-10 01:22:05,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:05,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:06,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:22:06,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:22:06,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:06,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:22:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363471639] [2025-01-10 01:22:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363471639] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948829480] [2025-01-10 01:22:06,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:06,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:06,058 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:06,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:22:06,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:22:06,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:22:06,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:06,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:06,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:22:06,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:22:06,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:22:06,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948829480] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:06,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:06,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2025-01-10 01:22:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701474960] [2025-01-10 01:22:06,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:06,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:22:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:06,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:22:06,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:22:06,247 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:06,388 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-01-10 01:22:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:22:06,388 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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 28 [2025-01-10 01:22:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:06,389 INFO L225 Difference]: With dead ends: 65 [2025-01-10 01:22:06,389 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 01:22:06,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:22:06,390 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:06,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 60 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:22:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 01:22:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-10 01:22:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-01-10 01:22:06,396 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 28 [2025-01-10 01:22:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:06,397 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-01-10 01:22:06,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-01-10 01:22:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 01:22:06,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:06,400 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:06,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:22:06,600 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-01-10 01:22:06,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:06,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1796844013, now seen corresponding path program 2 times [2025-01-10 01:22:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528474541] [2025-01-10 01:22:06,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:06,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:22:06,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 37 statements. [2025-01-10 01:22:06,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:06,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 01:22:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528474541] [2025-01-10 01:22:06,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528474541] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503254554] [2025-01-10 01:22:06,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:06,636 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:06,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:22:06,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:22:06,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 37 statements. [2025-01-10 01:22:06,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:06,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:06,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:22:06,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 01:22:06,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 01:22:06,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503254554] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:06,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:06,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-10 01:22:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579343589] [2025-01-10 01:22:06,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:06,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:22:06,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:06,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:22:06,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:22:06,752 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:06,781 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-01-10 01:22:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:22:06,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 37 [2025-01-10 01:22:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:06,782 INFO L225 Difference]: With dead ends: 54 [2025-01-10 01:22:06,782 INFO L226 Difference]: Without dead ends: 53 [2025-01-10 01:22:06,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:22:06,782 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:06,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-10 01:22:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2025-01-10 01:22:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-01-10 01:22:06,786 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 37 [2025-01-10 01:22:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:06,787 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-01-10 01:22:06,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-01-10 01:22:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 01:22:06,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:06,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:06,800 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-01-10 01:22:06,987 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-01-10 01:22:06,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:22:06,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1755233415, now seen corresponding path program 2 times [2025-01-10 01:22:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:06,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917970624] [2025-01-10 01:22:06,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:06,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:22:06,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 38 statements. [2025-01-10 01:22:06,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:06,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:22:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:07,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917970624] [2025-01-10 01:22:07,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917970624] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:07,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613729240] [2025-01-10 01:22:07,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:22:07,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:07,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:07,025 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:22:07,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:22:07,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:22:07,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 38 statements. [2025-01-10 01:22:07,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:22:07,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:07,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:22:07,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:22:07,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:22:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613729240] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:07,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:07,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-10 01:22:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101545569] [2025-01-10 01:22:07,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:07,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:22:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:07,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:22:07,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:22:07,134 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:07,162 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-01-10 01:22:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:22:07,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 38 [2025-01-10 01:22:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:07,163 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:22:07,163 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:22:07,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:22:07,163 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:07,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:22:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:22:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:22:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:22:07,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2025-01-10 01:22:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:07,164 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:22:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:22:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:22:07,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:22:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:22:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:22:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:22:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:22:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:22:07,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:22:07,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:22:07,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:07,374 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:22:07,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:22:07,627 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:22:07,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:22:07 BoogieIcfgContainer [2025-01-10 01:22:07,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:22:07,643 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:22:07,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:22:07,643 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:22:07,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:22:01" (3/4) ... [2025-01-10 01:22:07,645 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:22:07,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 01:22:07,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:22:07,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:22:07,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:22:07,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:22:07,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:22:07,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:22:07,716 INFO L158 Benchmark]: Toolchain (without parser) took 6197.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 111.3MB in the beginning and 254.0MB in the end (delta: -142.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2025-01-10 01:22:07,716 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:07,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.35ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 100.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:07,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.55ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 98.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:07,717 INFO L158 Benchmark]: Boogie Preprocessor took 56.19ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.7MB in the end (delta: 894.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:07,717 INFO L158 Benchmark]: RCFGBuilder took 234.98ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 85.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:07,718 INFO L158 Benchmark]: TraceAbstraction took 5644.86ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 84.8MB in the beginning and 259.5MB in the end (delta: -174.7MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2025-01-10 01:22:07,718 INFO L158 Benchmark]: Witness Printer took 72.29ms. Allocated memory is still 302.0MB. Free memory was 259.5MB in the beginning and 254.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:07,720 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.35ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 100.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.55ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 98.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.19ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.7MB in the end (delta: 894.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.98ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 85.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5644.86ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 84.8MB in the beginning and 259.5MB in the end (delta: -174.7MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Witness Printer took 72.29ms. Allocated memory is still 302.0MB. Free memory was 259.5MB in the beginning and 254.0MB in the end (delta: 5.5MB). 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: 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, 29 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 661 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 460 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1110 IncrementalHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 201 mSDtfsCounter, 1110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 349 SyntacticMatches, 16 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=10, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 59 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 472 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 1633 SizeOfPredicates, 13 NumberOfNonLiveVariables, 722 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 299/448 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 6 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((1 <= i) && (N <= 2147483647)) && (2 <= N)) || (((i == 0) && (N <= 2147483647)) && (2 <= N))) || ((N == 1) && (i == 1))) || ((i == 0) && (N == 1))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((i == 0) && (N <= 2147483647)) && (1 <= N)) || (((1 <= i) && (N <= 2147483647)) && (2 <= N))) || (((N <= 2147483647) && (i == 1)) && (1 <= N))) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((1 <= i) && (N <= 2147483647)) && (2 <= N)) || (((i == 0) && (N <= 2147483647)) && (2 <= N))) || ((N == 1) && (i == 1))) || ((i == 0) && (N == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:22:07,742 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