./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_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_postdec_17_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 d9bea5117c8c0a4ec3b6d04ad34749e11f55baa315238093be8814a55966f647 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 05:25:25,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 05:25:25,239 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:25:25,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 05:25:25,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 05:25:25,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 05:25:25,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 05:25:25,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 05:25:25,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 05:25:25,269 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 05:25:25,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 05:25:25,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 05:25:25,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 05:25:25,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 05:25:25,270 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 05:25:25,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 05:25:25,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 05:25:25,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 05:25:25,272 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 05:25:25,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:25:25,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:25:25,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:25:25,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:25:25,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:25:25,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 05:25:25,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 05:25:25,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 05:25:25,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 05:25:25,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 05:25:25,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 05:25:25,274 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 -> d9bea5117c8c0a4ec3b6d04ad34749e11f55baa315238093be8814a55966f647 [2025-01-10 05:25:25,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 05:25:25,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 05:25:25,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 05:25:25,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 05:25:25,535 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 05:25:25,536 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_postdec_17_good.i [2025-01-10 05:25:26,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c5f34a6e/8a3dd2ddc7614ea9bed543dcafe38cfa/FLAG3ff064d66 [2025-01-10 05:25:27,327 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 05:25:27,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_good.i [2025-01-10 05:25:27,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c5f34a6e/8a3dd2ddc7614ea9bed543dcafe38cfa/FLAG3ff064d66 [2025-01-10 05:25:27,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c5f34a6e/8a3dd2ddc7614ea9bed543dcafe38cfa [2025-01-10 05:25:27,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 05:25:27,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 05:25:27,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 05:25:27,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 05:25:27,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 05:25:27,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:25:27" (1/1) ... [2025-01-10 05:25:27,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c07404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:27, skipping insertion in model container [2025-01-10 05:25:27,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:25:27" (1/1) ... [2025-01-10 05:25:27,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 05:25:28,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:25:28,127 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 05:25:28,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:25:28,367 INFO L204 MainTranslator]: Completed translation [2025-01-10 05:25:28,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28 WrapperNode [2025-01-10 05:25:28,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 05:25:28,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 05:25:28,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 05:25:28,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 05:25:28,376 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:25:28" (1/1) ... [2025-01-10 05:25:28,393 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:25:28" (1/1) ... [2025-01-10 05:25:28,411 INFO L138 Inliner]: procedures = 500, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2025-01-10 05:25:28,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 05:25:28,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 05:25:28,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 05:25:28,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 05:25:28,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,430 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-01-10 05:25:28,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 05:25:28,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 05:25:28,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 05:25:28,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 05:25:28,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (1/1) ... [2025-01-10 05:25:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:25:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:25:28,474 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:25:28,501 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:25:28,533 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 05:25:28,536 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 05:25:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 05:25:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 05:25:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 05:25:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 05:25:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 05:25:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 05:25:28,667 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 05:25:28,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 05:25:28,778 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-10 05:25:28,779 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 05:25:28,786 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 05:25:28,786 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 05:25:28,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:25:28 BoogieIcfgContainer [2025-01-10 05:25:28,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 05:25:28,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 05:25:28,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 05:25:28,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 05:25:28,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:25:27" (1/3) ... [2025-01-10 05:25:28,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447166d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:25:28, skipping insertion in model container [2025-01-10 05:25:28,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:25:28" (2/3) ... [2025-01-10 05:25:28,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447166d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:25:28, skipping insertion in model container [2025-01-10 05:25:28,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:25:28" (3/3) ... [2025-01-10 05:25:28,795 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_17_good.i [2025-01-10 05:25:28,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 05:25:28,807 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_postdec_17_good.i that has 3 procedures, 57 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-01-10 05:25:28,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 05:25:28,852 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;@70a0c1fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 05:25:28,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 05:25:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 50 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:25:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 05:25:28,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:28,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:28,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 906186749, now seen corresponding path program 1 times [2025-01-10 05:25:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:28,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593093289] [2025-01-10 05:25:28,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:28,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 05:25:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 05:25:28,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:28,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:29,060 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:25:29,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593093289] [2025-01-10 05:25:29,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593093289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:29,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:29,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004465037] [2025-01-10 05:25:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:29,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:25:29,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:29,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:25:29,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:25:29,083 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 50 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:29,118 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2025-01-10 05:25:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:25:29,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 05:25:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:29,125 INFO L225 Difference]: With dead ends: 106 [2025-01-10 05:25:29,125 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 05:25:29,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:25:29,129 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 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:25:29,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 05:25:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-01-10 05:25:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:25:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-01-10 05:25:29,163 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 12 [2025-01-10 05:25:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:29,163 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-01-10 05:25:29,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-01-10 05:25:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 05:25:29,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:29,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:29,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 05:25:29,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:29,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:29,166 INFO L85 PathProgramCache]: Analyzing trace with hash 905754844, now seen corresponding path program 1 times [2025-01-10 05:25:29,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:29,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319143752] [2025-01-10 05:25:29,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:29,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 05:25:29,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 05:25:29,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:29,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:29,354 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:25:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:29,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319143752] [2025-01-10 05:25:29,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319143752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:29,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:29,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774657056] [2025-01-10 05:25:29,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:29,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:25:29,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:29,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:25:29,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:29,360 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:29,414 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-01-10 05:25:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:25:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 05:25:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:29,415 INFO L225 Difference]: With dead ends: 58 [2025-01-10 05:25:29,416 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 05:25:29,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:29,417 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:29,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 160 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 05:25:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 05:25:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 50 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:25:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-01-10 05:25:29,423 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 12 [2025-01-10 05:25:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:29,423 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-01-10 05:25:29,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-01-10 05:25:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 05:25:29,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:29,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:29,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 05:25:29,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:29,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1643437498, now seen corresponding path program 1 times [2025-01-10 05:25:29,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:29,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301465538] [2025-01-10 05:25:29,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:29,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:29,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 05:25:29,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 05:25:29,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:29,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 05:25:29,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:29,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301465538] [2025-01-10 05:25:29,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301465538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:29,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:29,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:25:29,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725162955] [2025-01-10 05:25:29,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:29,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:25:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:29,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:25:29,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:25:29,531 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:29,544 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-01-10 05:25:29,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:25:29,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-10 05:25:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:29,545 INFO L225 Difference]: With dead ends: 56 [2025-01-10 05:25:29,546 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 05:25:29,546 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:25:29,547 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 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:25:29,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 05:25:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-10 05:25:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.5) internal successors, (54), 49 states have internal predecessors, (54), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:25:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-01-10 05:25:29,553 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 17 [2025-01-10 05:25:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:29,553 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-01-10 05:25:29,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-01-10 05:25:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 05:25:29,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:29,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:29,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 05:25:29,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:29,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1643869403, now seen corresponding path program 1 times [2025-01-10 05:25:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:29,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400766816] [2025-01-10 05:25:29,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:29,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 05:25:29,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 05:25:29,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:29,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:25:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400766816] [2025-01-10 05:25:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400766816] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:25:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627230920] [2025-01-10 05:25:29,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:29,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:25:29,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:25:29,757 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:25:29,759 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:25:29,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 05:25:29,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 05:25:29,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:29,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:29,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 05:25:29,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:25:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:25:29,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:25:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627230920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:29,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:25:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 05:25:29,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157226529] [2025-01-10 05:25:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 05:25:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:29,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 05:25:29,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:25:29,955 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:29,993 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2025-01-10 05:25:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 05:25:29,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-10 05:25:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:29,995 INFO L225 Difference]: With dead ends: 93 [2025-01-10 05:25:29,995 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 05:25:29,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:25:29,996 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:29,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 148 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 05:25:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 05:25:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.4375) internal successors, (46), 42 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:25:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-01-10 05:25:30,007 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 17 [2025-01-10 05:25:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:30,007 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-01-10 05:25:30,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-01-10 05:25:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 05:25:30,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:30,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:30,021 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:25:30,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:25:30,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:30,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash 593045187, now seen corresponding path program 1 times [2025-01-10 05:25:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:30,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951568050] [2025-01-10 05:25:30,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:30,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 05:25:30,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 05:25:30,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:30,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:25:30,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:30,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951568050] [2025-01-10 05:25:30,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951568050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:30,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:30,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:30,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499210228] [2025-01-10 05:25:30,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:30,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:25:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:30,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:25:30,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:30,317 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:30,336 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-01-10 05:25:30,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:25:30,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 05:25:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:30,337 INFO L225 Difference]: With dead ends: 48 [2025-01-10 05:25:30,337 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 05:25:30,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:30,338 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:30,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 131 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 05:25:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-10 05:25:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.40625) internal successors, (45), 41 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:25:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-01-10 05:25:30,345 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2025-01-10 05:25:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:30,345 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-01-10 05:25:30,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-01-10 05:25:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 05:25:30,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:30,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:30,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 05:25:30,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:30,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash 593659938, now seen corresponding path program 1 times [2025-01-10 05:25:30,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:30,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924427706] [2025-01-10 05:25:30,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:30,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:30,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 05:25:30,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 05:25:30,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:30,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 05:25:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924427706] [2025-01-10 05:25:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924427706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359587429] [2025-01-10 05:25:30,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:30,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:25:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:30,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:25:30,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:25:30,446 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:30,475 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2025-01-10 05:25:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:25:30,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 05:25:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:30,480 INFO L225 Difference]: With dead ends: 75 [2025-01-10 05:25:30,480 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 05:25:30,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:25:30,481 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:30,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 102 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 05:25:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2025-01-10 05:25:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.393939393939394) internal successors, (46), 42 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:25:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-01-10 05:25:30,486 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2025-01-10 05:25:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:30,487 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-01-10 05:25:30,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 05:25:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-01-10 05:25:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 05:25:30,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:30,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:30,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 05:25:30,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:30,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1506547324, now seen corresponding path program 1 times [2025-01-10 05:25:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315312169] [2025-01-10 05:25:30,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:30,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 05:25:30,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 05:25:30,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:30,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 05:25:30,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315312169] [2025-01-10 05:25:30,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315312169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:30,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:30,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:30,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910834642] [2025-01-10 05:25:30,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:30,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:25:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:30,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:25:30,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:30,595 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 05:25:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:30,629 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-01-10 05:25:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:25:30,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-01-10 05:25:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:30,631 INFO L225 Difference]: With dead ends: 59 [2025-01-10 05:25:30,632 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 05:25:30,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:30,633 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:30,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 145 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 05:25:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-10 05:25:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.35) internal successors, (54), 50 states have internal predecessors, (54), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 05:25:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-01-10 05:25:30,659 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 23 [2025-01-10 05:25:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:30,659 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-01-10 05:25:30,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 05:25:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-01-10 05:25:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 05:25:30,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:30,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:30,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 05:25:30,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1219672860, now seen corresponding path program 1 times [2025-01-10 05:25:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916557809] [2025-01-10 05:25:30,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:30,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 05:25:30,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 05:25:30,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:30,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:25:30,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:30,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916557809] [2025-01-10 05:25:30,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916557809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:30,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:30,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309092576] [2025-01-10 05:25:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:30,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:25:30,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:30,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:25:30,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:30,770 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:25:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:30,803 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-01-10 05:25:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:25:30,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-01-10 05:25:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:30,805 INFO L225 Difference]: With dead ends: 76 [2025-01-10 05:25:30,805 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 05:25:30,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:30,807 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:30,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 151 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 05:25:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-10 05:25:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 53 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 05:25:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-01-10 05:25:30,822 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 28 [2025-01-10 05:25:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:30,823 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-01-10 05:25:30,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:25:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-01-10 05:25:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 05:25:30,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:30,825 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 05:25:30,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 05:25:30,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:30,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash -149056698, now seen corresponding path program 1 times [2025-01-10 05:25:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:30,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870126913] [2025-01-10 05:25:30,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:30,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 05:25:30,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 05:25:30,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:30,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:25:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870126913] [2025-01-10 05:25:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870126913] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:25:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382698533] [2025-01-10 05:25:30,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:30,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:25:30,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:25:30,946 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:25:30,947 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:25:31,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 05:25:31,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 05:25:31,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:31,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:31,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 05:25:31,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:25:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:25:31,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:25:31,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382698533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:31,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:25:31,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 05:25:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366171713] [2025-01-10 05:25:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 05:25:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:31,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 05:25:31,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:25:31,126 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:25:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:31,168 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2025-01-10 05:25:31,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 05:25:31,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-10 05:25:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:31,170 INFO L225 Difference]: With dead ends: 75 [2025-01-10 05:25:31,170 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 05:25:31,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:25:31,171 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:31,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 05:25:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 05:25:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 49 states have internal predecessors, (52), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 05:25:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-01-10 05:25:31,177 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 31 [2025-01-10 05:25:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:31,181 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-01-10 05:25:31,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:25:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-01-10 05:25:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 05:25:31,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:31,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:31,192 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:25:31,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:25:31,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:31,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash 57061314, now seen corresponding path program 1 times [2025-01-10 05:25:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657632528] [2025-01-10 05:25:31,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:31,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 05:25:31,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 05:25:31,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:31,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 05:25:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657632528] [2025-01-10 05:25:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657632528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:25:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258154916] [2025-01-10 05:25:31,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:31,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:25:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:25:31,462 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:25:31,465 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:25:31,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 05:25:31,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 05:25:31,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:31,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:31,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 05:25:31,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:25:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 05:25:31,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:25:31,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258154916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:31,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:25:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 05:25:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585238087] [2025-01-10 05:25:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:31,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 05:25:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:31,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 05:25:31,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:25:31,564 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 05:25:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:31,586 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2025-01-10 05:25:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 05:25:31,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-01-10 05:25:31,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:31,587 INFO L225 Difference]: With dead ends: 80 [2025-01-10 05:25:31,587 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 05:25:31,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:25:31,588 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:31,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 167 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 05:25:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-10 05:25:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 39 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:25:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-01-10 05:25:31,591 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 33 [2025-01-10 05:25:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:31,592 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-01-10 05:25:31,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 05:25:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-01-10 05:25:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 05:25:31,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:31,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:31,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 05:25:31,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:25:31,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -325784224, now seen corresponding path program 1 times [2025-01-10 05:25:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109841329] [2025-01-10 05:25:31,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:31,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 05:25:31,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 05:25:31,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:31,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:25:31,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109841329] [2025-01-10 05:25:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109841329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:31,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306160693] [2025-01-10 05:25:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:25:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:31,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:25:31,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:31,849 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:25:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:31,861 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-01-10 05:25:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:25:31,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-10 05:25:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:31,862 INFO L225 Difference]: With dead ends: 49 [2025-01-10 05:25:31,862 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 05:25:31,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:31,863 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:31,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 05:25:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-01-10 05:25:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 41 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:25:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-01-10 05:25:31,866 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 32 [2025-01-10 05:25:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:31,866 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-01-10 05:25:31,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:25:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-01-10 05:25:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 05:25:31,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:31,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:31,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 05:25:31,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:31,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:31,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1509376246, now seen corresponding path program 1 times [2025-01-10 05:25:31,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:31,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839401294] [2025-01-10 05:25:31,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:31,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:31,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 05:25:31,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 05:25:31,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:31,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 05:25:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:31,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839401294] [2025-01-10 05:25:31,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839401294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:31,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:31,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812615056] [2025-01-10 05:25:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:31,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:25:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:31,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:25:31,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:31,919 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:25:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:31,932 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-01-10 05:25:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:25:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-01-10 05:25:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:31,933 INFO L225 Difference]: With dead ends: 47 [2025-01-10 05:25:31,933 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 05:25:31,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:31,933 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:31,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 05:25:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-10 05:25:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 40 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 05:25:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-01-10 05:25:31,937 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 33 [2025-01-10 05:25:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:31,937 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-01-10 05:25:31,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 05:25:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-01-10 05:25:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 05:25:31,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:31,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:31,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 05:25:31,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:31,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1163478548, now seen corresponding path program 1 times [2025-01-10 05:25:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:31,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372698979] [2025-01-10 05:25:31,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:31,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 05:25:31,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 05:25:31,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:31,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 05:25:32,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:32,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372698979] [2025-01-10 05:25:32,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372698979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:32,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:25:32,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:25:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166913685] [2025-01-10 05:25:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:32,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:25:32,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:32,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:25:32,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:32,019 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:25:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:32,037 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-01-10 05:25:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:25:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 39 [2025-01-10 05:25:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:32,038 INFO L225 Difference]: With dead ends: 53 [2025-01-10 05:25:32,038 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 05:25:32,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:25:32,038 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:25:32,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 05:25:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-10 05:25:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 05:25:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-01-10 05:25:32,049 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 39 [2025-01-10 05:25:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:32,049 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-01-10 05:25:32,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:25:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-01-10 05:25:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 05:25:32,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:25:32,050 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 05:25:32,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 05:25:32,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-01-10 05:25:32,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:25:32,050 INFO L85 PathProgramCache]: Analyzing trace with hash -803233850, now seen corresponding path program 1 times [2025-01-10 05:25:32,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:25:32,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584097446] [2025-01-10 05:25:32,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:32,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:25:32,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 05:25:32,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 05:25:32,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:32,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 05:25:32,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:25:32,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584097446] [2025-01-10 05:25:32,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584097446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 05:25:32,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277294870] [2025-01-10 05:25:32,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:25:32,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 05:25:32,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:25:32,163 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:25:32,164 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:25:32,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 05:25:32,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 05:25:32,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:25:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:25:32,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 05:25:32,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 05:25:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 05:25:32,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 05:25:32,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277294870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:25:32,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 05:25:32,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 05:25:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524713886] [2025-01-10 05:25:32,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:25:32,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 05:25:32,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:25:32,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 05:25:32,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:25:32,292 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:25:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:25:32,313 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-01-10 05:25:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 05:25:32,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 42 [2025-01-10 05:25:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:25:32,314 INFO L225 Difference]: With dead ends: 55 [2025-01-10 05:25:32,314 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 05:25:32,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 05:25:32,314 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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:25:32,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:25:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 05:25:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 05:25:32,315 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:25:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 05:25:32,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2025-01-10 05:25:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:25:32,315 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 05:25:32,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:25:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 05:25:32,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 05:25:32,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-01-10 05:25:32,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-01-10 05:25:32,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-01-10 05:25:32,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-01-10 05:25:32,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-01-10 05:25:32,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-01-10 05:25:32,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-01-10 05:25:32,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-01-10 05:25:32,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-01-10 05:25:32,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-01-10 05:25:32,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-01-10 05:25:32,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-01-10 05:25:32,332 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:25:32,522 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,SelfDestructingSolverStorable13 [2025-01-10 05:25:32,525 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:25:32,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 05:25:32,592 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 05:25:32,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:25:32 BoogieIcfgContainer [2025-01-10 05:25:32,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 05:25:32,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 05:25:32,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 05:25:32,609 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 05:25:32,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:25:28" (3/4) ... [2025-01-10 05:25:32,611 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 05:25:32,615 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 05:25:32,615 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 05:25:32,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-10 05:25:32,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 05:25:32,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 05:25:32,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 05:25:32,680 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 05:25:32,681 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 05:25:32,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 05:25:32,682 INFO L158 Benchmark]: Toolchain (without parser) took 5296.83ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 107.4MB in the beginning and 247.8MB in the end (delta: -140.4MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2025-01-10 05:25:32,682 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 226.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:25:32,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 982.40ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 44.4MB in the end (delta: 62.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 05:25:32,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.39ms. Allocated memory is still 142.6MB. Free memory was 44.4MB in the beginning and 42.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:25:32,683 INFO L158 Benchmark]: Boogie Preprocessor took 29.05ms. Allocated memory is still 142.6MB. Free memory was 42.1MB in the beginning and 39.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:25:32,683 INFO L158 Benchmark]: RCFGBuilder took 341.74ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 96.1MB in the end (delta: -56.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2025-01-10 05:25:32,683 INFO L158 Benchmark]: TraceAbstraction took 3819.77ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 95.4MB in the beginning and 254.7MB in the end (delta: -159.3MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-01-10 05:25:32,683 INFO L158 Benchmark]: Witness Printer took 72.24ms. Allocated memory is still 369.1MB. Free memory was 254.7MB in the beginning and 247.8MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 05:25:32,686 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.40ms. Allocated memory is still 226.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 982.40ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 44.4MB in the end (delta: 62.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.39ms. Allocated memory is still 142.6MB. Free memory was 44.4MB in the beginning and 42.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.05ms. Allocated memory is still 142.6MB. Free memory was 42.1MB in the beginning and 39.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 341.74ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 96.1MB in the end (delta: -56.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3819.77ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 95.4MB in the beginning and 254.7MB in the end (delta: -159.3MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 72.24ms. Allocated memory is still 369.1MB. Free memory was 254.7MB in the beginning and 247.8MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 1948 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1236 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 712 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=8, InterpolantAutomatonStates: 57, 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, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 109/113 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 12 specifications checked. All of them hold - InvariantResult [Line: 1590]: Loop Invariant Derived loop invariant: (((j == 0) && (((long) data + 2) == 0)) || ((1 <= j) && (((long) data + 2) <= 0))) - InvariantResult [Line: 1586]: Loop Invariant Derived loop invariant: (((1 <= h) && (((long) data + 2) == 0)) || ((h == 0) && (0 <= ((long) data + 2)))) - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((i == 0) && (data <= 2147483647)) || ((1 <= i) && (data <= 2147483647))) - InvariantResult [Line: 1567]: Loop Invariant Derived loop invariant: (((1 <= k) && (data <= 2147483647)) || ((k == 0) && (data <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-01-10 05:25:32,706 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