./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:56:39,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:56:39,951 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:56:39,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:56:39,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:56:39,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:56:39,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:56:39,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:56:39,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:56:39,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:56:39,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:56:39,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:56:39,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:56:39,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:56:39,976 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:56:39,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:56:39,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:56:39,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:56:39,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:39,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:56:39,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:39,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:56:39,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:56:39,979 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 -> ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e [2025-01-10 01:56:40,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:56:40,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:56:40,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:56:40,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:56:40,219 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:56:40,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2025-01-10 01:56:41,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/764b966f0/df0df4b0b2134fafaf7d911a15ccc584/FLAG229efea4b [2025-01-10 01:56:41,691 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:56:41,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2025-01-10 01:56:41,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/764b966f0/df0df4b0b2134fafaf7d911a15ccc584/FLAG229efea4b [2025-01-10 01:56:42,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/764b966f0/df0df4b0b2134fafaf7d911a15ccc584 [2025-01-10 01:56:42,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:56:42,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:56:42,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:56:42,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:56:42,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:56:42,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c587079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42, skipping insertion in model container [2025-01-10 01:56:42,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:56:42,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:56:42,144 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:56:42,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:56:42,169 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:56:42,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42 WrapperNode [2025-01-10 01:56:42,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:56:42,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:56:42,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:56:42,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:56:42,177 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:56:42" (1/1) ... [2025-01-10 01:56:42,182 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:56:42" (1/1) ... [2025-01-10 01:56:42,194 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-01-10 01:56:42,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:56:42,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:56:42,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:56:42,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:56:42,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,215 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:56:42,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:56:42,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:56:42,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:56:42,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:56:42,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:42,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:42,257 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:56:42,260 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:56:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:56:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 01:56:42,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 01:56:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:56:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:56:42,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:56:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:56:42,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:56:42,332 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:56:42,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:56:42,461 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-10 01:56:42,461 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:56:42,471 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:56:42,471 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:56:42,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:42 BoogieIcfgContainer [2025-01-10 01:56:42,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:56:42,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:56:42,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:56:42,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:56:42,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:56:42" (1/3) ... [2025-01-10 01:56:42,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f91e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:56:42, skipping insertion in model container [2025-01-10 01:56:42,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (2/3) ... [2025-01-10 01:56:42,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f91e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:56:42, skipping insertion in model container [2025-01-10 01:56:42,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:42" (3/3) ... [2025-01-10 01:56:42,480 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2025-01-10 01:56:42,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:56:42,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin_unwindbound2.i that has 3 procedures, 37 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 01:56:42,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:56:42,554 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;@558d9d89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:56:42,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:56:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:56:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:56:42,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:42,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:42,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:42,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -604571649, now seen corresponding path program 1 times [2025-01-10 01:56:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:42,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116174047] [2025-01-10 01:56:42,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:42,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:56:42,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:56:42,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:42,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:56:42,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:42,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116174047] [2025-01-10 01:56:42,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116174047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:42,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36033050] [2025-01-10 01:56:42,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:42,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:42,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:42,702 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:56:42,703 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:56:42,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:56:42,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:56:42,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:42,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:42,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 01:56:42,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:56:42,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:56:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36033050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:56:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-10 01:56:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514535790] [2025-01-10 01:56:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:42,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:56:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:42,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:56:42,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:56:42,789 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:56:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:42,806 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2025-01-10 01:56:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:56:42,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-01-10 01:56:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:42,814 INFO L225 Difference]: With dead ends: 70 [2025-01-10 01:56:42,815 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 01:56:42,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:56:42,819 INFO L435 NwaCegarLoop]: 42 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, 42 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:56:42,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 01:56:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 01:56:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-01-10 01:56:42,857 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2025-01-10 01:56:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:42,857 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-01-10 01:56:42,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:56:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-01-10 01:56:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:56:42,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:42,858 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:42,866 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:56:43,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 01:56:43,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash 153751231, now seen corresponding path program 1 times [2025-01-10 01:56:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558846343] [2025-01-10 01:56:43,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:56:43,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:56:43,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558846343] [2025-01-10 01:56:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558846343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:43,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:43,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:56:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987406524] [2025-01-10 01:56:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:43,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:56:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:43,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:56:43,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:56:43,156 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:43,187 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-01-10 01:56:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:56:43,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-01-10 01:56:43,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:43,188 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:56:43,188 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:56:43,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:43,189 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:43,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:56:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-01-10 01:56:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-01-10 01:56:43,193 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2025-01-10 01:56:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:43,194 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-01-10 01:56:43,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-01-10 01:56:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:56:43,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:56:43,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash 471320908, now seen corresponding path program 1 times [2025-01-10 01:56:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062442579] [2025-01-10 01:56:43,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:56:43,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:56:43,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062442579] [2025-01-10 01:56:43,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062442579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:43,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:43,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:56:43,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976053612] [2025-01-10 01:56:43,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:43,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:56:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:43,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:56:43,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:56:43,270 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:43,306 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2025-01-10 01:56:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:43,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-01-10 01:56:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:43,309 INFO L225 Difference]: With dead ends: 46 [2025-01-10 01:56:43,309 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:56:43,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:43,311 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:43,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:56:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:56:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-01-10 01:56:43,320 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2025-01-10 01:56:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:43,321 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-01-10 01:56:43,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-01-10 01:56:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:56:43,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:56:43,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1297086228, now seen corresponding path program 1 times [2025-01-10 01:56:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802063478] [2025-01-10 01:56:43,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:56:43,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:56:43,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:43,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:43,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802063478] [2025-01-10 01:56:43,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802063478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:43,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:43,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:56:43,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31736435] [2025-01-10 01:56:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:43,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:56:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:43,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:56:43,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:43,446 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:43,530 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-01-10 01:56:43,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:56:43,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-01-10 01:56:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:43,531 INFO L225 Difference]: With dead ends: 32 [2025-01-10 01:56:43,531 INFO L226 Difference]: Without dead ends: 31 [2025-01-10 01:56:43,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:43,536 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:43,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-10 01:56:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-10 01:56:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-01-10 01:56:43,540 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2025-01-10 01:56:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:43,540 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-01-10 01:56:43,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-01-10 01:56:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:56:43,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:56:43,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1554967468, now seen corresponding path program 1 times [2025-01-10 01:56:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833560584] [2025-01-10 01:56:43,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:56:43,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:56:43,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:43,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833560584] [2025-01-10 01:56:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833560584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:43,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:43,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:56:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403342044] [2025-01-10 01:56:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:43,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:56:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:43,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:56:43,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:43,645 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:43,704 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-01-10 01:56:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:56:43,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-01-10 01:56:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:43,705 INFO L225 Difference]: With dead ends: 41 [2025-01-10 01:56:43,705 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 01:56:43,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:43,706 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:43,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 01:56:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-01-10 01:56:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-10 01:56:43,710 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2025-01-10 01:56:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:43,710 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-10 01:56:43,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-10 01:56:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:56:43,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:56:43,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1555006197, now seen corresponding path program 1 times [2025-01-10 01:56:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606704742] [2025-01-10 01:56:43,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:56:43,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:56:43,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606704742] [2025-01-10 01:56:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606704742] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570994234] [2025-01-10 01:56:43,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:43,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:43,768 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:56:43,769 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:56:43,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:56:43,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:56:43,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:56:43,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:43,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:56:43,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570994234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:43,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:56:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 01:56:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219431147] [2025-01-10 01:56:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:43,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:56:43,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:43,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:56:43,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:43,842 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:43,888 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-01-10 01:56:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:43,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-01-10 01:56:43,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:43,889 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:56:43,889 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:56:43,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:56:43,890 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:43,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:56:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-01-10 01:56:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-01-10 01:56:43,894 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2025-01-10 01:56:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:43,894 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-01-10 01:56:43,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-01-10 01:56:43,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:56:43,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:56:44,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:44,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:44,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:44,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1565410493, now seen corresponding path program 1 times [2025-01-10 01:56:44,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:44,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45349622] [2025-01-10 01:56:44,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:44,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:56:44,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:56:44,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:44,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45349622] [2025-01-10 01:56:44,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45349622] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:44,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027413229] [2025-01-10 01:56:44,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:44,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:44,169 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:56:44,170 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:56:44,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:56:44,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:56:44,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:56:44,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027413229] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:44,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:44,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2025-01-10 01:56:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283552352] [2025-01-10 01:56:44,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:44,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:56:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:44,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:56:44,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:44,293 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:56:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:44,326 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-01-10 01:56:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:56:44,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2025-01-10 01:56:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:44,327 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:56:44,327 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:56:44,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:44,328 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:44,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:56:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 01:56:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-01-10 01:56:44,331 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2025-01-10 01:56:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:44,332 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-01-10 01:56:44,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:56:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-01-10 01:56:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:56:44,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:44,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:44,338 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:56:44,537 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:56:44,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:44,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1285172317, now seen corresponding path program 1 times [2025-01-10 01:56:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017447480] [2025-01-10 01:56:44,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:44,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:56:44,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:56:44,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:44,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017447480] [2025-01-10 01:56:44,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017447480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:44,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634203082] [2025-01-10 01:56:44,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:44,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:44,622 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:56:44,623 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:56:44,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:56:44,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:56:44,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:56:44,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634203082] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:44,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:44,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-01-10 01:56:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317569642] [2025-01-10 01:56:44,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:56:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:44,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:56:44,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:56:44,816 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:56:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:45,007 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-01-10 01:56:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:56:45,007 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-01-10 01:56:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:45,008 INFO L225 Difference]: With dead ends: 64 [2025-01-10 01:56:45,008 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 01:56:45,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:56:45,009 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 107 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:45,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 135 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:56:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 01:56:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2025-01-10 01:56:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:56:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2025-01-10 01:56:45,014 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 26 [2025-01-10 01:56:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:45,014 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2025-01-10 01:56:45,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:56:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2025-01-10 01:56:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 01:56:45,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:45,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:45,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:56:45,215 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,SelfDestructingSolverStorable7 [2025-01-10 01:56:45,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:45,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1782354170, now seen corresponding path program 1 times [2025-01-10 01:56:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729643426] [2025-01-10 01:56:45,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:45,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 01:56:45,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 01:56:45,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:45,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:56:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729643426] [2025-01-10 01:56:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729643426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:45,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:45,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:56:45,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172151049] [2025-01-10 01:56:45,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:45,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:56:45,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:45,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:56:45,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:45,299 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:56:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:45,326 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2025-01-10 01:56:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2025-01-10 01:56:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:45,329 INFO L225 Difference]: With dead ends: 86 [2025-01-10 01:56:45,329 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 01:56:45,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:45,329 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:45,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 01:56:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2025-01-10 01:56:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:56:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-01-10 01:56:45,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 52 [2025-01-10 01:56:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:45,334 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-01-10 01:56:45,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:56:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-01-10 01:56:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 01:56:45,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:45,335 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:45,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:56:45,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:45,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:45,336 INFO L85 PathProgramCache]: Analyzing trace with hash -712969754, now seen corresponding path program 1 times [2025-01-10 01:56:45,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:45,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25821487] [2025-01-10 01:56:45,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:45,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:56:45,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:56:45,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:45,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:56:45,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25821487] [2025-01-10 01:56:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25821487] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730006433] [2025-01-10 01:56:45,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:45,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:45,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:45,454 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:56:45,458 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:56:45,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:56:45,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:56:45,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:45,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:45,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:56:45,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:56:45,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:56:45,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730006433] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:45,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:45,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-01-10 01:56:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971809775] [2025-01-10 01:56:45,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:56:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:45,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:56:45,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:56:45,640 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-10 01:56:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:45,711 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-01-10 01:56:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:56:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 54 [2025-01-10 01:56:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:45,712 INFO L225 Difference]: With dead ends: 54 [2025-01-10 01:56:45,712 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:56:45,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:56:45,713 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:45,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 65 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:56:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:56:45,715 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:56:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:56:45,715 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2025-01-10 01:56:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:45,715 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:56:45,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-10 01:56:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:56:45,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:56:45,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 01:56:45,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 01:56:45,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 01:56:45,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 01:56:45,725 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:56:45,919 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:56:45,921 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:45,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:56:45,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:56:46,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:56:46 BoogieIcfgContainer [2025-01-10 01:56:46,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:56:46,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:56:46,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:56:46,004 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:56:46,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:42" (3/4) ... [2025-01-10 01:56:46,006 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:56:46,010 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-10 01:56:46,010 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:56:46,012 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 01:56:46,012 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:56:46,013 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:56:46,013 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:56:46,073 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:56:46,073 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:56:46,073 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:56:46,074 INFO L158 Benchmark]: Toolchain (without parser) took 4062.67ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.2MB in the beginning and 362.9MB in the end (delta: -249.7MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2025-01-10 01:56:46,074 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:56:46,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.97ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 102.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:46,075 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.53ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 100.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:56:46,075 INFO L158 Benchmark]: Boogie Preprocessor took 26.67ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.8MB in the end (delta: 959.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:56:46,075 INFO L158 Benchmark]: RCFGBuilder took 245.35ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 87.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:46,075 INFO L158 Benchmark]: TraceAbstraction took 3530.73ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 87.4MB in the beginning and 368.9MB in the end (delta: -281.5MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2025-01-10 01:56:46,076 INFO L158 Benchmark]: Witness Printer took 68.96ms. Allocated memory is still 427.8MB. Free memory was 368.9MB in the beginning and 362.9MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:46,077 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.64ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.97ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 102.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.53ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 100.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.67ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.8MB in the end (delta: 959.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 245.35ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 87.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3530.73ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 87.4MB in the beginning and 368.9MB in the end (delta: -281.5MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. * Witness Printer took 68.96ms. Allocated memory is still 427.8MB. Free memory was 368.9MB in the beginning and 362.9MB in the end (delta: 5.9MB). 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: 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 3 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 768 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 511 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 257 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 231 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=8, InterpolantAutomatonStates: 74, 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, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 493 ConstructedInterpolants, 0 QuantifiedInterpolants, 931 SizeOfPredicates, 12 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 232/261 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 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 2)) || ((2 <= counter) && (counter <= 3))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 2)) || (counter == 0)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:56:46,090 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