./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/gcd01-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-numeric/gcd01-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 45c5821ff02aca8bda5f221968fe713118b5c593fcfc7e422e3a99fb31bf02bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:31:58,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:31:59,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:31:59,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:31:59,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:31:59,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:31:59,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:31:59,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:31:59,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:31:59,053 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:31:59,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:31:59,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:31:59,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:31:59,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:31:59,054 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:31:59,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:31:59,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:31:59,056 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:31:59,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:31:59,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:31:59,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:31:59,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:31:59,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:31:59,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:31:59,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:31:59,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:31:59,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:31:59,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:31:59,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:31:59,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:31:59,058 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45c5821ff02aca8bda5f221968fe713118b5c593fcfc7e422e3a99fb31bf02bb [2025-01-10 01:31:59,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:31:59,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:31:59,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:31:59,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:31:59,284 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:31:59,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/gcd01-2.c [2025-01-10 01:32:00,433 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/873299d62/340fe4b968de429b83eb1e73127fc1d9/FLAG519593243 [2025-01-10 01:32:00,639 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:32:00,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-numeric/gcd01-2.c [2025-01-10 01:32:00,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/873299d62/340fe4b968de429b83eb1e73127fc1d9/FLAG519593243 [2025-01-10 01:32:00,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/873299d62/340fe4b968de429b83eb1e73127fc1d9 [2025-01-10 01:32:00,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:32:00,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:32:00,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:32:00,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:32:00,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:32:00,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0b9450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00, skipping insertion in model container [2025-01-10 01:32:00,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:32:00,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:32:00,776 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:32:00,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:32:00,796 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:32:00,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00 WrapperNode [2025-01-10 01:32:00,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:32:00,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:32:00,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:32:00,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:32:00,802 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:32:00" (1/1) ... [2025-01-10 01:32:00,805 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:32:00" (1/1) ... [2025-01-10 01:32:00,813 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-01-10 01:32:00,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:32:00,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:32:00,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:32:00,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:32:00,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:32:00,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:32:00,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:32:00,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:32:00,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:32:00,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (1/1) ... [2025-01-10 01:32:00,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:00,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:00,853 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:32:00,856 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:32:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:32:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2025-01-10 01:32:00,872 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2025-01-10 01:32:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:32:00,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:32:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:32:00,916 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:32:00,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:32:01,019 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-10 01:32:01,019 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:32:01,024 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:32:01,025 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:32:01,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:32:01 BoogieIcfgContainer [2025-01-10 01:32:01,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:32:01,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:32:01,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:32:01,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:32:01,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:32:00" (1/3) ... [2025-01-10 01:32:01,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8ee69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:32:01, skipping insertion in model container [2025-01-10 01:32:01,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:00" (2/3) ... [2025-01-10 01:32:01,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8ee69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:32:01, skipping insertion in model container [2025-01-10 01:32:01,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:32:01" (3/3) ... [2025-01-10 01:32:01,031 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd01-2.c [2025-01-10 01:32:01,041 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:32:01,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd01-2.c that has 2 procedures, 30 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 01:32:01,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:32:01,084 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;@44b3a950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:32:01,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:32:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:32:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:32:01,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:01,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:01,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:32:01,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash 995104148, now seen corresponding path program 1 times [2025-01-10 01:32:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868403398] [2025-01-10 01:32:01,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:01,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:01,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:32:01,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:32:01,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:01,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:01,225 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:32:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:01,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868403398] [2025-01-10 01:32:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868403398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:01,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:32:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896655931] [2025-01-10 01:32:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:01,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:32:01,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:01,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:32:01,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:32:01,244 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:01,284 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-01-10 01:32:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:32:01,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:32:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:01,290 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:32:01,290 INFO L226 Difference]: Without dead ends: 18 [2025-01-10 01:32:01,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:32:01,295 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:01,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-10 01:32:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-10 01:32:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-01-10 01:32:01,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2025-01-10 01:32:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:01,326 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-01-10 01:32:01,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-01-10 01:32:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:32:01,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:01,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:01,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:32:01,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:32:01,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash 995103924, now seen corresponding path program 1 times [2025-01-10 01:32:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:01,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614539089] [2025-01-10 01:32:01,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:01,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:32:01,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:32:01,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:01,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:01,385 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:32:01,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:01,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614539089] [2025-01-10 01:32:01,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614539089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:01,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:01,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:32:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976452366] [2025-01-10 01:32:01,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:01,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:32:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:01,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:32:01,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:32:01,388 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:01,405 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-01-10 01:32:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:32:01,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:32:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:01,406 INFO L225 Difference]: With dead ends: 18 [2025-01-10 01:32:01,406 INFO L226 Difference]: Without dead ends: 17 [2025-01-10 01:32:01,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:32:01,407 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:01,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-10 01:32:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-10 01:32:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-01-10 01:32:01,410 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2025-01-10 01:32:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:01,410 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-01-10 01:32:01,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-01-10 01:32:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:32:01,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:01,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:32:01,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:32:01,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash 783457568, now seen corresponding path program 1 times [2025-01-10 01:32:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171641582] [2025-01-10 01:32:01,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:01,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:32:01,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:32:01,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:01,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:01,500 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:32:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171641582] [2025-01-10 01:32:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171641582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:01,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:32:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806483951] [2025-01-10 01:32:01,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:01,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:32:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:01,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:32:01,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:32:01,501 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:01,564 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-01-10 01:32:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:32:01,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:32:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:01,565 INFO L225 Difference]: With dead ends: 17 [2025-01-10 01:32:01,565 INFO L226 Difference]: Without dead ends: 16 [2025-01-10 01:32:01,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:32:01,565 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:01,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 19 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-10 01:32:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-10 01:32:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-01-10 01:32:01,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2025-01-10 01:32:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:01,568 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-10 01:32:01,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-01-10 01:32:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:32:01,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:01,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:01,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:32:01,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:32:01,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 783450617, now seen corresponding path program 1 times [2025-01-10 01:32:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:01,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101164255] [2025-01-10 01:32:01,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:01,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:32:01,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:32:01,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:01,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:01,628 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:32:01,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:01,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101164255] [2025-01-10 01:32:01,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101164255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:01,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:01,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:32:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637068897] [2025-01-10 01:32:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:01,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:32:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:01,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:32:01,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:32:01,629 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:01,685 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-01-10 01:32:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:32:01,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:32:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:01,686 INFO L225 Difference]: With dead ends: 16 [2025-01-10 01:32:01,686 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:32:01,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:32:01,687 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:01,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 19 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:32:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:32:01,688 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:32:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:32:01,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2025-01-10 01:32:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:01,688 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:32:01,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:32:01,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:32:01,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 01:32:01,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 01:32:01,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 01:32:01,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 01:32:01,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:32:01,694 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 01:32:01,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:32:01,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:32:01,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:32:01 BoogieIcfgContainer [2025-01-10 01:32:01,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:32:01,788 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:32:01,788 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:32:01,788 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:32:01,789 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:32:01" (3/4) ... [2025-01-10 01:32:01,790 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:32:01,794 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2025-01-10 01:32:01,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 01:32:01,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 01:32:01,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:32:01,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:32:01,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:32:01,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:32:01,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:32:01,847 INFO L158 Benchmark]: Toolchain (without parser) took 1191.88ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 46.7MB in the end (delta: 75.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-10 01:32:01,847 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:32:01,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.37ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 111.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:32:01,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.98ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:32:01,848 INFO L158 Benchmark]: Boogie Preprocessor took 16.20ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 109.1MB in the end (delta: 893.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:32:01,848 INFO L158 Benchmark]: RCFGBuilder took 194.46ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 97.5MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:32:01,848 INFO L158 Benchmark]: TraceAbstraction took 761.02ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 52.4MB in the end (delta: 44.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 01:32:01,848 INFO L158 Benchmark]: Witness Printer took 58.33ms. Allocated memory is still 167.8MB. Free memory was 52.4MB in the beginning and 46.7MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:32:01,849 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.21ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.37ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 111.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.98ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.20ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 109.1MB in the end (delta: 893.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 194.46ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 97.5MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 761.02ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 52.4MB in the end (delta: 44.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 58.33ms. Allocated memory is still 167.8MB. Free memory was 52.4MB in the beginning and 46.7MB in the end (delta: 5.7MB). 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: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 62 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 01:32:01,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE