./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_08_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bab1191501d9bcf67b9be9d631041d2fa19f25793bb46c191a69e4db5abb0bef --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 05:27:22,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 05:27:22,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 05:27:22,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 05:27:22,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 05:27:22,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 05:27:22,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 05:27:22,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 05:27:22,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 05:27:22,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 05:27:22,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 05:27:22,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 05:27:22,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 05:27:22,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 05:27:22,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:27:22,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:27:22,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 05:27:22,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 05:27:22,423 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bab1191501d9bcf67b9be9d631041d2fa19f25793bb46c191a69e4db5abb0bef [2025-01-10 05:27:22,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 05:27:22,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 05:27:22,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 05:27:22,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 05:27:22,758 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 05:27:22,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_08_good.i [2025-01-10 05:27:24,005 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53a328653/d0eb625cb59d4a19b4d5e57851e341e8/FLAGc66e7f5a6 [2025-01-10 05:27:24,397 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 05:27:24,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_08_good.i [2025-01-10 05:27:24,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53a328653/d0eb625cb59d4a19b4d5e57851e341e8/FLAGc66e7f5a6 [2025-01-10 05:27:24,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53a328653/d0eb625cb59d4a19b4d5e57851e341e8 [2025-01-10 05:27:24,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 05:27:24,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 05:27:24,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 05:27:24,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 05:27:24,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 05:27:24,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:27:24" (1/1) ... [2025-01-10 05:27:24,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe4335a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:24, skipping insertion in model container [2025-01-10 05:27:24,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:27:24" (1/1) ... [2025-01-10 05:27:24,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 05:27:25,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:27:25,258 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 05:27:25,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:27:25,408 INFO L204 MainTranslator]: Completed translation [2025-01-10 05:27:25,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25 WrapperNode [2025-01-10 05:27:25,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 05:27:25,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 05:27:25,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 05:27:25,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 05:27:25,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,464 INFO L138 Inliner]: procedures = 504, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 157 [2025-01-10 05:27:25,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 05:27:25,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 05:27:25,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 05:27:25,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 05:27:25,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,492 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-01-10 05:27:25,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 05:27:25,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 05:27:25,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 05:27:25,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 05:27:25,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (1/1) ... [2025-01-10 05:27:25,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:27:25,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:25,551 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 05:27:25,556 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 05:27:25,571 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 05:27:25,572 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 05:27:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 05:27:25,572 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 05:27:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 05:27:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 05:27:25,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 05:27:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-01-10 05:27:25,572 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-01-10 05:27:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-01-10 05:27:25,572 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-01-10 05:27:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 05:27:25,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 05:27:25,676 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 05:27:25,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 05:27:25,896 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-10 05:27:25,896 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 05:27:25,903 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 05:27:25,903 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 05:27:25,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:27:25 BoogieIcfgContainer [2025-01-10 05:27:25,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 05:27:25,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 05:27:25,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 05:27:25,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 05:27:25,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:27:24" (1/3) ... [2025-01-10 05:27:25,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10638538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:27:25, skipping insertion in model container [2025-01-10 05:27:25,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:27:25" (2/3) ... [2025-01-10 05:27:25,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10638538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:27:25, skipping insertion in model container [2025-01-10 05:27:25,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:27:25" (3/3) ... [2025-01-10 05:27:25,910 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_sub_08_good.i [2025-01-10 05:27:25,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 05:27:25,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_sub_08_good.i that has 5 procedures, 87 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 05:27:25,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 05:27:25,982 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;@61fa7c3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 05:27:25,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 05:27:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 05:27:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 05:27:25,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:25,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:25,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:26,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:26,002 INFO L85 PathProgramCache]: Analyzing trace with hash 890812736, now seen corresponding path program 1 times [2025-01-10 05:27:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:26,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795864565] [2025-01-10 05:27:26,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:26,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:26,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 05:27:26,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 05:27:26,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:26,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:27:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795864565] [2025-01-10 05:27:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795864565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:26,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:27:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 05:27:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811183447] [2025-01-10 05:27:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:26,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:27:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:26,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:27:26,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:27:26,327 INFO L87 Difference]: Start difference. First operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 05:27:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:26,359 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2025-01-10 05:27:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:27:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-01-10 05:27:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:26,366 INFO L225 Difference]: With dead ends: 164 [2025-01-10 05:27:26,366 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 05:27:26,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:27:26,370 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:26,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 331 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 05:27:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 05:27:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 05:27:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-01-10 05:27:26,408 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 22 [2025-01-10 05:27:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:26,409 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-01-10 05:27:26,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 05:27:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-01-10 05:27:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 05:27:26,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:26,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:26,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 05:27:26,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:26,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:26,412 INFO L85 PathProgramCache]: Analyzing trace with hash 770660731, now seen corresponding path program 1 times [2025-01-10 05:27:26,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:26,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865977874] [2025-01-10 05:27:26,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:26,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:26,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 05:27:26,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 05:27:26,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:26,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:27:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865977874] [2025-01-10 05:27:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865977874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:27:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:27:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202927950] [2025-01-10 05:27:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:26,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:26,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:26,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:27:26,483 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 05:27:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:26,512 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2025-01-10 05:27:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:26,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-01-10 05:27:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:26,513 INFO L225 Difference]: With dead ends: 142 [2025-01-10 05:27:26,514 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 05:27:26,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:27:26,515 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:26,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 197 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 05:27:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-01-10 05:27:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 63 states have internal predecessors, (70), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 108 transitions. [2025-01-10 05:27:26,532 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 108 transitions. Word has length 24 [2025-01-10 05:27:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:26,533 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 108 transitions. [2025-01-10 05:27:26,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 05:27:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 108 transitions. [2025-01-10 05:27:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 05:27:26,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:26,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:26,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 05:27:26,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:26,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:26,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1879321038, now seen corresponding path program 1 times [2025-01-10 05:27:26,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:26,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628276934] [2025-01-10 05:27:26,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:26,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:26,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 05:27:26,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 05:27:26,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:26,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:27:26,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:26,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628276934] [2025-01-10 05:27:26,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628276934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:26,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:27:26,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:27:26,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644376035] [2025-01-10 05:27:26,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:26,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:26,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:26,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:27:26,675 INFO L87 Difference]: Start difference. First operand 82 states and 108 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 05:27:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:26,712 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2025-01-10 05:27:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:26,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 25 [2025-01-10 05:27:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:26,718 INFO L225 Difference]: With dead ends: 83 [2025-01-10 05:27:26,718 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 05:27:26,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:27:26,719 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:26,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 179 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 05:27:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-01-10 05:27:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 62 states have internal predecessors, (69), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2025-01-10 05:27:26,738 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 25 [2025-01-10 05:27:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2025-01-10 05:27:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 05:27:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2025-01-10 05:27:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 05:27:26,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:26,739 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:26,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 05:27:26,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:26,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1109155225, now seen corresponding path program 1 times [2025-01-10 05:27:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:26,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618140149] [2025-01-10 05:27:26,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:26,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:26,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 05:27:26,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 05:27:26,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:26,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 05:27:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618140149] [2025-01-10 05:27:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618140149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:27:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 05:27:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153841452] [2025-01-10 05:27:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:26,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:27:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:26,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:27:26,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:27:26,836 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 05:27:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:26,854 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2025-01-10 05:27:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:27:26,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2025-01-10 05:27:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:26,862 INFO L225 Difference]: With dead ends: 137 [2025-01-10 05:27:26,862 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 05:27:26,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:27:26,863 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:26,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 05:27:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 05:27:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 61 states have internal predecessors, (67), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 05:27:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2025-01-10 05:27:26,877 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 42 [2025-01-10 05:27:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:26,877 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2025-01-10 05:27:26,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 05:27:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2025-01-10 05:27:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 05:27:26,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:26,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:26,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 05:27:26,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:26,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 98430113, now seen corresponding path program 1 times [2025-01-10 05:27:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:26,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494531601] [2025-01-10 05:27:26,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:26,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 05:27:26,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 05:27:26,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:26,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 05:27:26,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494531601] [2025-01-10 05:27:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494531601] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:27:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496183725] [2025-01-10 05:27:26,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:26,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:26,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:26,983 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 05:27:26,985 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 05:27:27,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 05:27:27,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 05:27:27,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:27,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:27,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 05:27:27,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:27:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 05:27:27,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:27:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496183725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:27,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:27:27,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 05:27:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361676500] [2025-01-10 05:27:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:27,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:27,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:27,119 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 05:27:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:27,135 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2025-01-10 05:27:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:27,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2025-01-10 05:27:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:27,136 INFO L225 Difference]: With dead ends: 128 [2025-01-10 05:27:27,136 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 05:27:27,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:27,141 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:27,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 05:27:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-01-10 05:27:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.280701754385965) internal successors, (73), 65 states have internal predecessors, (73), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2025-01-10 05:27:27,147 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 43 [2025-01-10 05:27:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:27,147 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2025-01-10 05:27:27,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 05:27:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2025-01-10 05:27:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 05:27:27,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:27,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:27,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 05:27:27,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:27,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:27,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1243633681, now seen corresponding path program 1 times [2025-01-10 05:27:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:27,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241651042] [2025-01-10 05:27:27,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:27,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 05:27:27,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 05:27:27,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:27,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 05:27:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241651042] [2025-01-10 05:27:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241651042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:27:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227465482] [2025-01-10 05:27:27,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:27,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:27,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:27,432 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 05:27:27,434 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 05:27:27,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 05:27:27,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 05:27:27,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:27,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:27,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 05:27:27,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:27:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 05:27:27,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:27:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227465482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:27:27,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 05:27:27,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716022477] [2025-01-10 05:27:27,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:27,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:27,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:27,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:27,540 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 05:27:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:27,555 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2025-01-10 05:27:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-01-10 05:27:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:27,556 INFO L225 Difference]: With dead ends: 89 [2025-01-10 05:27:27,556 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 05:27:27,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:27,557 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:27,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 185 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 05:27:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-01-10 05:27:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 66 states have internal predecessors, (74), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2025-01-10 05:27:27,562 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 44 [2025-01-10 05:27:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:27,563 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2025-01-10 05:27:27,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 05:27:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2025-01-10 05:27:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 05:27:27,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:27,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:27,570 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 05:27:27,764 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 05:27:27,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:27,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1824274276, now seen corresponding path program 1 times [2025-01-10 05:27:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:27,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816137075] [2025-01-10 05:27:27,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:27,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 05:27:27,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 05:27:27,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:27,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 05:27:27,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:27,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816137075] [2025-01-10 05:27:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816137075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:27,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:27:27,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:27:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420286684] [2025-01-10 05:27:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:27,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:27,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:27,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:27,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:27:27,820 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 05:27:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:27,845 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2025-01-10 05:27:27,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:27,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2025-01-10 05:27:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:27,850 INFO L225 Difference]: With dead ends: 88 [2025-01-10 05:27:27,850 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 05:27:27,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:27:27,851 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:27,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 181 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 05:27:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-01-10 05:27:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 65 states have internal predecessors, (73), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2025-01-10 05:27:27,864 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 45 [2025-01-10 05:27:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:27,865 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2025-01-10 05:27:27,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 05:27:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2025-01-10 05:27:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 05:27:27,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:27,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:27,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 05:27:27,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:27,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -717927596, now seen corresponding path program 1 times [2025-01-10 05:27:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:27,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065520262] [2025-01-10 05:27:27,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:27,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 05:27:27,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 05:27:27,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:27,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 05:27:27,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:27,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065520262] [2025-01-10 05:27:27,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065520262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:27,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:27:27,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:27:27,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781126793] [2025-01-10 05:27:27,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:27,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:27,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:27,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:27:27,961 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 05:27:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:27,977 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2025-01-10 05:27:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:27,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2025-01-10 05:27:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:27,979 INFO L225 Difference]: With dead ends: 87 [2025-01-10 05:27:27,980 INFO L226 Difference]: Without dead ends: 86 [2025-01-10 05:27:27,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:27:27,981 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:27,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 168 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-10 05:27:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2025-01-10 05:27:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2025-01-10 05:27:27,992 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 46 [2025-01-10 05:27:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:27,993 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-01-10 05:27:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 05:27:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2025-01-10 05:27:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 05:27:27,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:27,998 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:27,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 05:27:27,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:27,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1039381269, now seen corresponding path program 1 times [2025-01-10 05:27:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763551766] [2025-01-10 05:27:27,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:28,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 05:27:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 05:27:28,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:28,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 05:27:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763551766] [2025-01-10 05:27:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763551766] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:27:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247465638] [2025-01-10 05:27:28,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:28,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:28,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:28,107 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 05:27:28,109 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 05:27:28,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 05:27:28,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 05:27:28,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:28,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:28,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 05:27:28,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:27:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 05:27:28,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:27:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247465638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:28,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:27:28,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 05:27:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147886683] [2025-01-10 05:27:28,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:28,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:28,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:28,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:28,206 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 05:27:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:28,215 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2025-01-10 05:27:28,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:28,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-01-10 05:27:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:28,217 INFO L225 Difference]: With dead ends: 84 [2025-01-10 05:27:28,217 INFO L226 Difference]: Without dead ends: 83 [2025-01-10 05:27:28,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:28,218 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:28,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-10 05:27:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-01-10 05:27:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2025-01-10 05:27:28,226 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 55 [2025-01-10 05:27:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:28,227 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2025-01-10 05:27:28,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 05:27:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2025-01-10 05:27:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 05:27:28,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:28,228 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:28,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 05:27:28,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:28,429 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:28,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2138918889, now seen corresponding path program 1 times [2025-01-10 05:27:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520383403] [2025-01-10 05:27:28,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:28,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 05:27:28,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 05:27:28,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:28,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 05:27:28,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:28,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520383403] [2025-01-10 05:27:28,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520383403] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:27:28,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727348867] [2025-01-10 05:27:28,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:28,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:28,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:28,518 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 05:27:28,520 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 05:27:28,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 05:27:28,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 05:27:28,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:28,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:28,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 05:27:28,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:27:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 05:27:28,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:27:28,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727348867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:28,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:27:28,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 05:27:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463170489] [2025-01-10 05:27:28,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:28,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:28,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:28,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:28,618 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 05:27:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:28,630 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2025-01-10 05:27:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2025-01-10 05:27:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:28,632 INFO L225 Difference]: With dead ends: 89 [2025-01-10 05:27:28,632 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 05:27:28,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:28,633 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:28,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 05:27:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-01-10 05:27:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 64 states have internal predecessors, (74), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 05:27:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2025-01-10 05:27:28,640 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 56 [2025-01-10 05:27:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:28,641 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2025-01-10 05:27:28,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 05:27:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2025-01-10 05:27:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-10 05:27:28,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:28,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:28,649 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 05:27:28,847 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,SelfDestructingSolverStorable9 [2025-01-10 05:27:28,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash -12223121, now seen corresponding path program 1 times [2025-01-10 05:27:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349679889] [2025-01-10 05:27:28,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:28,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 05:27:28,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 05:27:28,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:28,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 05:27:28,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:28,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349679889] [2025-01-10 05:27:28,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349679889] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:27:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235618329] [2025-01-10 05:27:28,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:28,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:28,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:28,905 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 05:27:28,907 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 05:27:28,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 05:27:29,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 05:27:29,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:29,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:29,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 05:27:29,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:27:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 05:27:29,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:27:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235618329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:29,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:27:29,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 05:27:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359383361] [2025-01-10 05:27:29,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:29,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:29,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:29,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:29,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:29,041 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-10 05:27:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:29,051 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2025-01-10 05:27:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:29,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-01-10 05:27:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:29,053 INFO L225 Difference]: With dead ends: 88 [2025-01-10 05:27:29,053 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 05:27:29,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:29,053 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:29,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 171 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 05:27:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2025-01-10 05:27:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 60 states have internal predecessors, (68), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2025-01-10 05:27:29,058 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 61 [2025-01-10 05:27:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:29,058 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2025-01-10 05:27:29,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-10 05:27:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2025-01-10 05:27:29,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 05:27:29,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:29,059 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:29,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 05:27:29,259 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,SelfDestructingSolverStorable10 [2025-01-10 05:27:29,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1296780122, now seen corresponding path program 1 times [2025-01-10 05:27:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938098239] [2025-01-10 05:27:29,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:29,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 05:27:29,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 05:27:29,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:29,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 05:27:29,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938098239] [2025-01-10 05:27:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938098239] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:27:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411609676] [2025-01-10 05:27:29,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:29,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:29,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 05:27:29,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 05:27:29,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 05:27:29,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 05:27:29,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:29,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:29,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 05:27:29,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:27:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 05:27:29,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:27:29,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411609676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:29,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:27:29,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 05:27:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63753102] [2025-01-10 05:27:29,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:29,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:29,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:29,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:29,576 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 05:27:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:29,586 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2025-01-10 05:27:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:29,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2025-01-10 05:27:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:29,587 INFO L225 Difference]: With dead ends: 81 [2025-01-10 05:27:29,588 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 05:27:29,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:29,588 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:29,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 05:27:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 05:27:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2025-01-10 05:27:29,593 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 68 [2025-01-10 05:27:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:29,593 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2025-01-10 05:27:29,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 05:27:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2025-01-10 05:27:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 05:27:29,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:29,594 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:29,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 05:27:29,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 05:27:29,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:29,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1545477955, now seen corresponding path program 1 times [2025-01-10 05:27:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669252607] [2025-01-10 05:27:29,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:29,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 05:27:29,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 05:27:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:29,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 05:27:29,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669252607] [2025-01-10 05:27:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669252607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:27:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667601942] [2025-01-10 05:27:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:29,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:29,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:29,854 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 05:27:29,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 05:27:29,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 05:27:29,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 05:27:29,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:29,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:29,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 05:27:29,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:27:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 05:27:29,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:27:29,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667601942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:29,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:27:29,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 05:27:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212150418] [2025-01-10 05:27:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:29,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:29,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:29,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:29,971 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 05:27:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:29,984 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2025-01-10 05:27:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-01-10 05:27:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:29,985 INFO L225 Difference]: With dead ends: 86 [2025-01-10 05:27:29,987 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 05:27:29,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:29,988 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:29,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 05:27:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 05:27:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 05:27:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2025-01-10 05:27:29,993 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 69 [2025-01-10 05:27:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:29,994 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2025-01-10 05:27:29,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 05:27:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2025-01-10 05:27:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 05:27:29,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:27:29,995 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:30,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 05:27:30,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:30,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:27:30,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:27:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash -865419585, now seen corresponding path program 1 times [2025-01-10 05:27:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:27:30,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127002810] [2025-01-10 05:27:30,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:30,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:27:30,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 05:27:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 05:27:30,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:30,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-10 05:27:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:27:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127002810] [2025-01-10 05:27:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127002810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:27:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936028073] [2025-01-10 05:27:30,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:27:30,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:30,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:27:30,305 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 05:27:30,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 05:27:30,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 05:27:30,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 05:27:30,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:27:30,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:27:30,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 05:27:30,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:27:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 05:27:30,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:27:30,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936028073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:27:30,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:27:30,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 05:27:30,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919638929] [2025-01-10 05:27:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:27:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:27:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:27:30,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:27:30,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:30,409 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 05:27:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:27:30,415 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2025-01-10 05:27:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:27:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-01-10 05:27:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:27:30,419 INFO L225 Difference]: With dead ends: 80 [2025-01-10 05:27:30,419 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 05:27:30,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 05:27:30,419 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:27:30,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:27:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 05:27:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 05:27:30,420 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 05:27:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 05:27:30,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2025-01-10 05:27:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:27:30,421 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 05:27:30,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-10 05:27:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 05:27:30,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 05:27:30,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 05:27:30,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 05:27:30,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 05:27:30,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 05:27:30,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 05:27:30,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 05:27:30,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 05:27:30,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 05:27:30,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 05:27:30,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:27:30,631 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:27:30,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 05:27:30,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 05:27:30,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:27:30 BoogieIcfgContainer [2025-01-10 05:27:30,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 05:27:30,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 05:27:30,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 05:27:30,706 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 05:27:30,706 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:27:25" (3/4) ... [2025-01-10 05:27:30,708 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 05:27:30,712 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 05:27:30,712 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-01-10 05:27:30,713 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 05:27:30,713 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-01-10 05:27:30,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-10 05:27:30,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 05:27:30,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 05:27:30,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 05:27:30,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 05:27:30,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 05:27:30,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 05:27:30,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 05:27:30,781 INFO L158 Benchmark]: Toolchain (without parser) took 6198.83ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.5MB in the beginning and 119.0MB in the end (delta: -12.5MB). Peak memory consumption was 130.9MB. Max. memory is 16.1GB. [2025-01-10 05:27:30,781 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:27:30,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 825.39ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 44.5MB in the end (delta: 62.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 05:27:30,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.48ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 41.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:27:30,781 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 142.6MB. Free memory was 41.6MB in the beginning and 39.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:27:30,781 INFO L158 Benchmark]: RCFGBuilder took 398.50ms. Allocated memory is still 142.6MB. Free memory was 39.7MB in the beginning and 91.8MB in the end (delta: -52.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-01-10 05:27:30,782 INFO L158 Benchmark]: TraceAbstraction took 4800.33ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 91.0MB in the beginning and 126.1MB in the end (delta: -35.1MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. [2025-01-10 05:27:30,782 INFO L158 Benchmark]: Witness Printer took 74.40ms. Allocated memory is still 285.2MB. Free memory was 126.1MB in the beginning and 119.0MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:27:30,783 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.72ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 825.39ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 44.5MB in the end (delta: 62.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.48ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 41.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 142.6MB. Free memory was 41.6MB in the beginning and 39.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 398.50ms. Allocated memory is still 142.6MB. Free memory was 39.7MB in the beginning and 91.8MB in the end (delta: -52.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4800.33ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 91.0MB in the beginning and 126.1MB in the end (delta: -35.1MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. * Witness Printer took 74.40ms. Allocated memory is still 285.2MB. Free memory was 126.1MB in the beginning and 119.0MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1637]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1637]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: 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 5 procedures, 87 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 2741 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1399 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1342 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 18 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1134 NumberOfCodeBlocks, 1134 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1785 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 529/569 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 05:27:30,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE