./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark38_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-zilu/benchmark38_conjunctive.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 366d45071e2a444aa552f231e24508af3eb704e415c6b738128a0398e54b53a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:46:58,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:46:58,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:46:58,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:46:58,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:46:58,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:46:58,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:46:58,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:46:58,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:46:58,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:46:58,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:46:58,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:46:58,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:46:58,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:46:58,160 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:46:58,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:46:58,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:46:58,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:46:58,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:46:58,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:46:58,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:46:58,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 366d45071e2a444aa552f231e24508af3eb704e415c6b738128a0398e54b53a7 [2025-01-10 01:46:58,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:46:58,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:46:58,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:46:58,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:46:58,360 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:46:58,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark38_conjunctive.i [2025-01-10 01:46:59,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29339890d/3e451787ec0549d79969f72b501ca539/FLAG546009b80 [2025-01-10 01:46:59,727 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:46:59,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark38_conjunctive.i [2025-01-10 01:46:59,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29339890d/3e451787ec0549d79969f72b501ca539/FLAG546009b80 [2025-01-10 01:47:00,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29339890d/3e451787ec0549d79969f72b501ca539 [2025-01-10 01:47:00,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:47:00,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:47:00,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:47:00,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:47:00,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:47:00,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00, skipping insertion in model container [2025-01-10 01:47:00,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:47:00,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:47:00,272 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:47:00,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:47:00,294 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:47:00,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00 WrapperNode [2025-01-10 01:47:00,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:47:00,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:47:00,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:47:00,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:47:00,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,315 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-01-10 01:47:00,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:47:00,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:47:00,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:47:00,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:47:00,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,335 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:47:00,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:47:00,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:47:00,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:47:00,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:47:00,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (1/1) ... [2025-01-10 01:47:00,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:47:00,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:00,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:47:00,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:47:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:47:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:47:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:47:00,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:47:00,433 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:47:00,434 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:47:00,496 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-10 01:47:00,496 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:47:00,501 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:47:00,501 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:47:00,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:47:00 BoogieIcfgContainer [2025-01-10 01:47:00,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:47:00,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:47:00,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:47:00,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:47:00,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:47:00" (1/3) ... [2025-01-10 01:47:00,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce9659f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:47:00, skipping insertion in model container [2025-01-10 01:47:00,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:00" (2/3) ... [2025-01-10 01:47:00,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce9659f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:47:00, skipping insertion in model container [2025-01-10 01:47:00,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:47:00" (3/3) ... [2025-01-10 01:47:00,507 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark38_conjunctive.i [2025-01-10 01:47:00,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:47:00,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark38_conjunctive.i that has 1 procedures, 24 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-10 01:47:00,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:47:00,551 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;@7367c190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:47:00,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:47:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:47:00,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:00,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:47:00,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:00,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash 28696326, now seen corresponding path program 1 times [2025-01-10 01:47:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:00,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805865622] [2025-01-10 01:47:00,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:00,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:00,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:47:00,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:47:00,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:00,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:00,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:00,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805865622] [2025-01-10 01:47:00,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805865622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:00,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:00,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:00,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564148450] [2025-01-10 01:47:00,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:00,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:47:00,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:00,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:47:00,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:47:00,645 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:00,651 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2025-01-10 01:47:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:47:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:47:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:00,656 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:47:00,656 INFO L226 Difference]: Without dead ends: 17 [2025-01-10 01:47:00,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:47:00,659 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:00,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-10 01:47:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-10 01:47:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-01-10 01:47:00,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2025-01-10 01:47:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:00,677 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-01-10 01:47:00,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-01-10 01:47:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:47:00,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:00,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:47:00,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:47:00,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:00,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash 889570356, now seen corresponding path program 1 times [2025-01-10 01:47:00,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:00,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996130390] [2025-01-10 01:47:00,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:00,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:00,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:47:00,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:47:00,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:00,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:00,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996130390] [2025-01-10 01:47:00,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996130390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:00,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:00,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:00,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459039647] [2025-01-10 01:47:00,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:00,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:00,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:00,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:00,722 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:00,734 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-01-10 01:47:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:00,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:47:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:00,735 INFO L225 Difference]: With dead ends: 26 [2025-01-10 01:47:00,735 INFO L226 Difference]: Without dead ends: 25 [2025-01-10 01:47:00,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:00,736 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:00,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-10 01:47:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2025-01-10 01:47:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.5) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-01-10 01:47:00,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 6 [2025-01-10 01:47:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:00,739 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-01-10 01:47:00,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-01-10 01:47:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:47:00,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:00,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:47:00,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:47:00,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:00,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash 889570283, now seen corresponding path program 1 times [2025-01-10 01:47:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:00,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536409054] [2025-01-10 01:47:00,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:00,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:47:00,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:47:00,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:00,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536409054] [2025-01-10 01:47:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536409054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:00,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323836407] [2025-01-10 01:47:00,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:00,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:00,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:00,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:00,773 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:00,780 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-01-10 01:47:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:47:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:00,781 INFO L225 Difference]: With dead ends: 20 [2025-01-10 01:47:00,781 INFO L226 Difference]: Without dead ends: 19 [2025-01-10 01:47:00,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:00,782 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:00,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-10 01:47:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-10 01:47:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-01-10 01:47:00,784 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 6 [2025-01-10 01:47:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:00,785 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-01-10 01:47:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-01-10 01:47:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:47:00,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:00,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:47:00,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:00,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1806877322, now seen corresponding path program 1 times [2025-01-10 01:47:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922172898] [2025-01-10 01:47:00,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:00,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:47:00,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:47:00,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:00,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922172898] [2025-01-10 01:47:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922172898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:00,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:00,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602225871] [2025-01-10 01:47:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:00,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:00,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:00,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:00,810 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:00,821 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2025-01-10 01:47:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:00,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:47:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:00,822 INFO L225 Difference]: With dead ends: 24 [2025-01-10 01:47:00,822 INFO L226 Difference]: Without dead ends: 21 [2025-01-10 01:47:00,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:00,823 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 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 01:47:00,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-10 01:47:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-01-10 01:47:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-01-10 01:47:00,825 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2025-01-10 01:47:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:00,826 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-01-10 01:47:00,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-01-10 01:47:00,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:47:00,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:00,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:00,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:47:00,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:00,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:00,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875048, now seen corresponding path program 1 times [2025-01-10 01:47:00,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:00,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642398634] [2025-01-10 01:47:00,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:00,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:47:00,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:47:00,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:00,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642398634] [2025-01-10 01:47:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642398634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584750964] [2025-01-10 01:47:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:00,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:00,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:00,871 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:00,879 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-01-10 01:47:00,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:00,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:47:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:00,880 INFO L225 Difference]: With dead ends: 21 [2025-01-10 01:47:00,880 INFO L226 Difference]: Without dead ends: 20 [2025-01-10 01:47:00,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:00,881 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:00,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-10 01:47:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-10 01:47:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-01-10 01:47:00,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2025-01-10 01:47:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:00,883 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-01-10 01:47:00,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-01-10 01:47:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:47:00,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:00,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:00,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:47:00,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:00,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:00,885 INFO L85 PathProgramCache]: Analyzing trace with hash 178551693, now seen corresponding path program 1 times [2025-01-10 01:47:00,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:00,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924869425] [2025-01-10 01:47:00,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:00,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:00,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:47:00,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:47:00,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:00,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924869425] [2025-01-10 01:47:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924869425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432743227] [2025-01-10 01:47:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:00,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:00,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:00,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:00,915 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:00,930 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-01-10 01:47:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:00,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:47:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:00,931 INFO L225 Difference]: With dead ends: 20 [2025-01-10 01:47:00,931 INFO L226 Difference]: Without dead ends: 18 [2025-01-10 01:47:00,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:00,932 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:00,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-10 01:47:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-10 01:47:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-01-10 01:47:00,935 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-01-10 01:47:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:00,935 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-01-10 01:47:00,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-01-10 01:47:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:47:00,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:00,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:00,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:47:00,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:00,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1240135242, now seen corresponding path program 1 times [2025-01-10 01:47:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:00,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511812354] [2025-01-10 01:47:00,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:00,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:47:00,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:47:00,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:00,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511812354] [2025-01-10 01:47:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511812354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:00,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:00,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976121979] [2025-01-10 01:47:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:00,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:00,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:00,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:00,973 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:00,989 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-01-10 01:47:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:47:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:00,990 INFO L225 Difference]: With dead ends: 21 [2025-01-10 01:47:00,990 INFO L226 Difference]: Without dead ends: 20 [2025-01-10 01:47:00,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:00,991 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:00,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-10 01:47:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-10 01:47:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-01-10 01:47:00,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 9 [2025-01-10 01:47:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:00,994 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-01-10 01:47:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-01-10 01:47:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:47:00,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:00,994 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:00,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:47:00,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:00,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:00,995 INFO L85 PathProgramCache]: Analyzing trace with hash -744089423, now seen corresponding path program 1 times [2025-01-10 01:47:00,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:00,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356421264] [2025-01-10 01:47:00,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:00,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:47:01,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:47:01,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:01,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356421264] [2025-01-10 01:47:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356421264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131521584] [2025-01-10 01:47:01,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:01,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:01,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:01,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:01,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:47:01,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:47:01,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:47:01,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:01,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:01,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:47:01,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:01,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:01,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131521584] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:01,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:47:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792309626] [2025-01-10 01:47:01,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:01,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:47:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:01,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:47:01,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:47:01,232 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:01,275 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2025-01-10 01:47:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:47:01,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:47:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:01,276 INFO L225 Difference]: With dead ends: 38 [2025-01-10 01:47:01,276 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:47:01,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:47:01,276 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:01,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:47:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-01-10 01:47:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-01-10 01:47:01,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 13 [2025-01-10 01:47:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:01,279 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-01-10 01:47:01,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-01-10 01:47:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:47:01,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:01,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:01,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:01,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:01,484 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:01,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash -744091697, now seen corresponding path program 1 times [2025-01-10 01:47:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:01,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305814731] [2025-01-10 01:47:01,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:01,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:01,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:47:01,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:47:01,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:01,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:01,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305814731] [2025-01-10 01:47:01,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305814731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003861561] [2025-01-10 01:47:01,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:01,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:01,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:01,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:01,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:47:01,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:47:01,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:47:01,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:01,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:01,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:47:01,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:01,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003861561] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:01,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:01,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:47:01,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678652690] [2025-01-10 01:47:01,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:01,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:47:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:01,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:47:01,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:47:01,647 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:01,668 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-01-10 01:47:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:47:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:47:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:01,669 INFO L225 Difference]: With dead ends: 41 [2025-01-10 01:47:01,669 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 01:47:01,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:47:01,669 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:01,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 01:47:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2025-01-10 01:47:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-01-10 01:47:01,672 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 13 [2025-01-10 01:47:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:01,676 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-01-10 01:47:01,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-01-10 01:47:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:47:01,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:01,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-01-10 01:47:01,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:01,877 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 01:47:01,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:01,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash -619995688, now seen corresponding path program 1 times [2025-01-10 01:47:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:01,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272982243] [2025-01-10 01:47:01,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:01,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:47:01,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:47:01,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:01,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:01,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272982243] [2025-01-10 01:47:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272982243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472557700] [2025-01-10 01:47:01,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:01,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:02,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:02,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:02,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:47:02,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:47:02,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:47:02,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:02,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:02,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:47:02,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:02,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472557700] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:02,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 01:47:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927331973] [2025-01-10 01:47:02,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:02,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:47:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:02,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:47:02,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:47:02,164 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:02,216 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-01-10 01:47:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:47:02,217 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-10 01:47:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:02,220 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:47:02,220 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 01:47:02,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:47:02,221 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:02,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 01:47:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2025-01-10 01:47:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-01-10 01:47:02,226 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 21 [2025-01-10 01:47:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:02,227 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-01-10 01:47:02,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-01-10 01:47:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:47:02,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:02,228 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:02,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:02,430 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 01:47:02,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:02,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash 233589055, now seen corresponding path program 2 times [2025-01-10 01:47:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679197918] [2025-01-10 01:47:02,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:02,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:47:02,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:47:02,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:02,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679197918] [2025-01-10 01:47:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679197918] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923200725] [2025-01-10 01:47:02,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:02,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:02,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:02,531 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:02,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:47:02,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:47:02,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:47:02,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:02,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:02,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:47:02,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:02,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923200725] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:02,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-10 01:47:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392116840] [2025-01-10 01:47:02,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:02,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:47:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:02,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:47:02,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:47:02,702 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:02,740 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-01-10 01:47:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:47:02,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-10 01:47:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:02,740 INFO L225 Difference]: With dead ends: 66 [2025-01-10 01:47:02,741 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 01:47:02,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:47:02,741 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:02,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 01:47:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-01-10 01:47:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-01-10 01:47:02,745 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 25 [2025-01-10 01:47:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:02,745 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-01-10 01:47:02,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-01-10 01:47:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 01:47:02,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:02,746 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-01-10 01:47:02,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:02,950 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,SelfDestructingSolverStorable10 [2025-01-10 01:47:02,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:02,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash 283835076, now seen corresponding path program 2 times [2025-01-10 01:47:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:02,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486391050] [2025-01-10 01:47:02,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:02,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:47:02,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:47:02,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:02,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486391050] [2025-01-10 01:47:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486391050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281236603] [2025-01-10 01:47:03,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:03,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:03,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:03,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:47:03,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:47:03,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:47:03,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:03,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:03,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:47:03,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:03,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:03,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281236603] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:03,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:03,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:47:03,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782784950] [2025-01-10 01:47:03,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:03,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:47:03,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:03,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:47:03,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:47:03,181 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:03,222 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2025-01-10 01:47:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:47:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-10 01:47:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:03,223 INFO L225 Difference]: With dead ends: 85 [2025-01-10 01:47:03,223 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 01:47:03,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:47:03,224 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:03,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 01:47:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2025-01-10 01:47:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-01-10 01:47:03,237 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 31 [2025-01-10 01:47:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:03,237 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-01-10 01:47:03,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-01-10 01:47:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 01:47:03,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:03,238 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 1, 1, 1, 1] [2025-01-10 01:47:03,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:47:03,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:47:03,439 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:03,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2009219596, now seen corresponding path program 2 times [2025-01-10 01:47:03,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:03,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560034184] [2025-01-10 01:47:03,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:03,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:47:03,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:47:03,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:03,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560034184] [2025-01-10 01:47:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560034184] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624547478] [2025-01-10 01:47:03,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:03,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:03,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:03,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:03,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:47:03,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:47:03,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:47:03,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:03,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:03,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:47:03,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:03,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:04,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624547478] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:04,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:04,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-01-10 01:47:04,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870986196] [2025-01-10 01:47:04,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:04,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:47:04,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:04,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:47:04,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:47:04,018 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 30 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:04,091 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2025-01-10 01:47:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-10 01:47:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-10 01:47:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:04,092 INFO L225 Difference]: With dead ends: 117 [2025-01-10 01:47:04,092 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 01:47:04,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:47:04,092 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:04,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 01:47:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2025-01-10 01:47:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 95 states have (on average 1.1473684210526316) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2025-01-10 01:47:04,102 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 45 [2025-01-10 01:47:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:04,102 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2025-01-10 01:47:04,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 30 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2025-01-10 01:47:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 01:47:04,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:04,104 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:04,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:04,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:47:04,305 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1768359077, now seen corresponding path program 3 times [2025-01-10 01:47:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604090721] [2025-01-10 01:47:04,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:04,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 8 equivalence classes. [2025-01-10 01:47:04,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:47:04,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:47:04,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:04,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:04,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604090721] [2025-01-10 01:47:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604090721] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206378123] [2025-01-10 01:47:04,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:04,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:04,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:04,534 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:04,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:47:04,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 8 equivalence classes. [2025-01-10 01:47:04,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:47:04,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:47:04,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:04,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:47:04,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:04,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206378123] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:04,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-01-10 01:47:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449805010] [2025-01-10 01:47:04,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:04,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 01:47:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 01:47:04,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:47:04,850 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:04,915 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2025-01-10 01:47:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 01:47:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-01-10 01:47:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:04,916 INFO L225 Difference]: With dead ends: 124 [2025-01-10 01:47:04,916 INFO L226 Difference]: Without dead ends: 107 [2025-01-10 01:47:04,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:47:04,917 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:04,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 112 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-10 01:47:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2025-01-10 01:47:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 99 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2025-01-10 01:47:04,921 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 49 [2025-01-10 01:47:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:04,921 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2025-01-10 01:47:04,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2025-01-10 01:47:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 01:47:04,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:04,922 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-01-10 01:47:04,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:05,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:05,127 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:05,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1194440978, now seen corresponding path program 3 times [2025-01-10 01:47:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796887452] [2025-01-10 01:47:05,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:05,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 11 equivalence classes. [2025-01-10 01:47:05,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 01:47:05,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:47:05,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:05,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:05,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796887452] [2025-01-10 01:47:05,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796887452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:05,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752318952] [2025-01-10 01:47:05,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:05,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:05,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:05,283 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:05,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:47:05,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 11 equivalence classes. [2025-01-10 01:47:05,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 01:47:05,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:47:05,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:05,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:47:05,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:05,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752318952] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:05,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:47:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27854441] [2025-01-10 01:47:05,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:05,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:47:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:05,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:47:05,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:47:05,583 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 24 states, 23 states have (on average 5.739130434782608) internal successors, (132), 24 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:05,632 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2025-01-10 01:47:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:47:05,632 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.739130434782608) internal successors, (132), 24 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-10 01:47:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:05,633 INFO L225 Difference]: With dead ends: 173 [2025-01-10 01:47:05,633 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 01:47:05,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:47:05,634 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:05,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 154 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 01:47:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 144. [2025-01-10 01:47:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.1205673758865249) internal successors, (158), 143 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2025-01-10 01:47:05,640 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 67 [2025-01-10 01:47:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:05,640 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2025-01-10 01:47:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.739130434782608) internal successors, (132), 24 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2025-01-10 01:47:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 01:47:05,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:05,641 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 1, 1, 1, 1] [2025-01-10 01:47:05,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:47:05,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:47:05,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:05,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1512619476, now seen corresponding path program 3 times [2025-01-10 01:47:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:05,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805492233] [2025-01-10 01:47:05,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:05,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 15 equivalence classes. [2025-01-10 01:47:05,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 01:47:05,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-10 01:47:05,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:06,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:06,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805492233] [2025-01-10 01:47:06,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805492233] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:06,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725418971] [2025-01-10 01:47:06,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:06,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:06,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:06,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:06,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:47:06,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 15 equivalence classes. [2025-01-10 01:47:06,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 01:47:06,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-10 01:47:06,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:06,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 01:47:06,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:07,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725418971] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:07,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:07,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2025-01-10 01:47:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622264293] [2025-01-10 01:47:07,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-10 01:47:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:07,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-10 01:47:07,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2025-01-10 01:47:07,927 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,066 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2025-01-10 01:47:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-10 01:47:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-10 01:47:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,068 INFO L225 Difference]: With dead ends: 233 [2025-01-10 01:47:08,068 INFO L226 Difference]: Without dead ends: 232 [2025-01-10 01:47:08,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2025-01-10 01:47:08,069 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 104 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 171 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-10 01:47:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2025-01-10 01:47:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 191 states have (on average 1.1361256544502618) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2025-01-10 01:47:08,075 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 93 [2025-01-10 01:47:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,075 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2025-01-10 01:47:08,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2025-01-10 01:47:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 01:47:08,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,076 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:47:08,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:08,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:08,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2031770733, now seen corresponding path program 4 times [2025-01-10 01:47:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571373897] [2025-01-10 01:47:08,282 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,287 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 97 statements into 2 equivalence classes. [2025-01-10 01:47:08,295 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 01:47:08,296 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:08,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571373897] [2025-01-10 01:47:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571373897] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506966567] [2025-01-10 01:47:08,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:08,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:08,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:08,858 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:08,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:47:08,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 97 statements into 2 equivalence classes. [2025-01-10 01:47:08,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 01:47:08,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:08,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 01:47:08,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:09,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:09,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506966567] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:09,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:09,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2025-01-10 01:47:09,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095107180] [2025-01-10 01:47:09,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:09,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-01-10 01:47:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:09,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-01-10 01:47:09,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1090, Invalid=3070, Unknown=0, NotChecked=0, Total=4160 [2025-01-10 01:47:09,906 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 65 states, 64 states have (on average 3.078125) internal successors, (197), 65 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:10,048 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2025-01-10 01:47:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-10 01:47:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 3.078125) internal successors, (197), 65 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-10 01:47:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:10,049 INFO L225 Difference]: With dead ends: 240 [2025-01-10 01:47:10,049 INFO L226 Difference]: Without dead ends: 207 [2025-01-10 01:47:10,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1090, Invalid=3070, Unknown=0, NotChecked=0, Total=4160 [2025-01-10 01:47:10,051 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 105 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:10,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 181 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-01-10 01:47:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2025-01-10 01:47:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 193 states have (on average 1.0569948186528497) internal successors, (204), 195 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 204 transitions. [2025-01-10 01:47:10,056 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 204 transitions. Word has length 97 [2025-01-10 01:47:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:10,056 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 204 transitions. [2025-01-10 01:47:10,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 3.078125) internal successors, (197), 65 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 204 transitions. [2025-01-10 01:47:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-10 01:47:10,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:10,062 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-01-10 01:47:10,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:10,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:47:10,267 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:10,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 619673666, now seen corresponding path program 4 times [2025-01-10 01:47:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:10,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130621] [2025-01-10 01:47:10,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:10,273 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 139 statements into 2 equivalence classes. [2025-01-10 01:47:10,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-01-10 01:47:10,291 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:10,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:10,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130621] [2025-01-10 01:47:10,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:10,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576355653] [2025-01-10 01:47:10,699 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:10,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:10,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:10,704 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:10,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:47:10,734 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 139 statements into 2 equivalence classes. [2025-01-10 01:47:10,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-01-10 01:47:10,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:10,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:10,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:47:10,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:10,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:11,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576355653] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:11,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:11,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2025-01-10 01:47:11,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910882283] [2025-01-10 01:47:11,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:11,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-10 01:47:11,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:11,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-10 01:47:11,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 01:47:11,543 INFO L87 Difference]: Start difference. First operand 196 states and 204 transitions. Second operand has 49 states, 48 states have (on average 5.854166666666667) internal successors, (281), 49 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:11,669 INFO L93 Difference]: Finished difference Result 349 states and 372 transitions. [2025-01-10 01:47:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:47:11,670 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 5.854166666666667) internal successors, (281), 49 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-10 01:47:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:11,671 INFO L225 Difference]: With dead ends: 349 [2025-01-10 01:47:11,672 INFO L226 Difference]: Without dead ends: 348 [2025-01-10 01:47:11,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 01:47:11,673 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 134 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:11,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 287 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-10 01:47:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 288. [2025-01-10 01:47:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 285 states have (on average 1.1157894736842104) internal successors, (318), 287 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 318 transitions. [2025-01-10 01:47:11,682 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 318 transitions. Word has length 139 [2025-01-10 01:47:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:11,682 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 318 transitions. [2025-01-10 01:47:11,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 5.854166666666667) internal successors, (281), 49 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 318 transitions. [2025-01-10 01:47:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 01:47:11,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:11,684 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 1, 1, 1, 1] [2025-01-10 01:47:11,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:11,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:47:11,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:11,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1083221348, now seen corresponding path program 4 times [2025-01-10 01:47:11,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:11,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980135884] [2025-01-10 01:47:11,885 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:11,891 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 189 statements into 2 equivalence classes. [2025-01-10 01:47:11,940 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 01:47:11,940 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:11,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 0 proven. 2790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:13,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:13,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980135884] [2025-01-10 01:47:13,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980135884] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:13,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454711755] [2025-01-10 01:47:13,828 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:13,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:13,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:13,830 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:13,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:47:13,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 189 statements into 2 equivalence classes. [2025-01-10 01:47:13,917 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 01:47:13,917 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:13,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:13,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-10 01:47:13,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 0 proven. 2790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:14,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2790 backedges. 0 proven. 2790 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:16,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454711755] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:16,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:16,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 126 [2025-01-10 01:47:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881015514] [2025-01-10 01:47:16,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:16,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2025-01-10 01:47:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:16,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2025-01-10 01:47:16,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2025-01-10 01:47:16,754 INFO L87 Difference]: Start difference. First operand 288 states and 318 transitions. Second operand has 127 states, 126 states have (on average 3.0238095238095237) internal successors, (381), 127 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:17,068 INFO L93 Difference]: Finished difference Result 465 states and 527 transitions. [2025-01-10 01:47:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-01-10 01:47:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 127 states, 126 states have (on average 3.0238095238095237) internal successors, (381), 127 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2025-01-10 01:47:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:17,070 INFO L225 Difference]: With dead ends: 465 [2025-01-10 01:47:17,070 INFO L226 Difference]: Without dead ends: 464 [2025-01-10 01:47:17,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4833 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2025-01-10 01:47:17,073 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 241 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:17,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 272 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:47:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-10 01:47:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 386. [2025-01-10 01:47:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 383 states have (on average 1.1305483028720626) internal successors, (433), 385 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 433 transitions. [2025-01-10 01:47:17,081 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 433 transitions. Word has length 189 [2025-01-10 01:47:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:17,081 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 433 transitions. [2025-01-10 01:47:17,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 126 states have (on average 3.0238095238095237) internal successors, (381), 127 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 433 transitions. [2025-01-10 01:47:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 01:47:17,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:17,083 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:17,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:47:17,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:17,287 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:17,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1826358275, now seen corresponding path program 5 times [2025-01-10 01:47:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:17,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331070278] [2025-01-10 01:47:17,287 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:17,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:17,293 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 193 statements into 32 equivalence classes. [2025-01-10 01:47:17,339 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 01:47:17,339 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-01-10 01:47:17,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:19,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331070278] [2025-01-10 01:47:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331070278] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669064527] [2025-01-10 01:47:19,084 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:19,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:19,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:19,086 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:19,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:47:19,122 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 193 statements into 32 equivalence classes. [2025-01-10 01:47:19,194 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 01:47:19,194 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-01-10 01:47:19,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:19,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-10 01:47:19,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:19,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:22,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669064527] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:22,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:22,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2025-01-10 01:47:22,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573800168] [2025-01-10 01:47:22,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:22,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-01-10 01:47:22,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:22,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-01-10 01:47:22,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4160, Invalid=12096, Unknown=0, NotChecked=0, Total=16256 [2025-01-10 01:47:22,084 INFO L87 Difference]: Start difference. First operand 386 states and 433 transitions. Second operand has 128 states, 127 states have (on average 3.0236220472440944) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:22,410 INFO L93 Difference]: Finished difference Result 472 states and 503 transitions. [2025-01-10 01:47:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-01-10 01:47:22,411 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 3.0236220472440944) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2025-01-10 01:47:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:22,413 INFO L225 Difference]: With dead ends: 472 [2025-01-10 01:47:22,413 INFO L226 Difference]: Without dead ends: 407 [2025-01-10 01:47:22,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4773 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4160, Invalid=12096, Unknown=0, NotChecked=0, Total=16256 [2025-01-10 01:47:22,415 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 222 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:22,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 338 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:47:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-10 01:47:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 388. [2025-01-10 01:47:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 385 states have (on average 1.0493506493506493) internal successors, (404), 387 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 404 transitions. [2025-01-10 01:47:22,422 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 404 transitions. Word has length 193 [2025-01-10 01:47:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:22,422 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 404 transitions. [2025-01-10 01:47:22,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 3.0236220472440944) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 404 transitions. [2025-01-10 01:47:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-01-10 01:47:22,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:22,424 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 1, 1, 1, 1] [2025-01-10 01:47:22,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:22,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:22,629 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:22,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1516093718, now seen corresponding path program 5 times [2025-01-10 01:47:22,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:22,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015752645] [2025-01-10 01:47:22,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:22,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:22,641 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 283 statements into 47 equivalence classes. [2025-01-10 01:47:22,711 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 283 of 283 statements. [2025-01-10 01:47:22,712 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:47:22,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:24,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015752645] [2025-01-10 01:47:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015752645] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313408396] [2025-01-10 01:47:24,207 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:24,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:24,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:47:24,253 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 283 statements into 47 equivalence classes. [2025-01-10 01:47:24,425 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 283 of 283 statements. [2025-01-10 01:47:24,425 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:47:24,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:24,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 01:47:24,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:24,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:27,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313408396] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:27,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:27,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:47:27,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767116382] [2025-01-10 01:47:27,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:27,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:47:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:27,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:47:27,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:47:27,003 INFO L87 Difference]: Start difference. First operand 388 states and 404 transitions. Second operand has 96 states, 95 states have (on average 5.936842105263158) internal successors, (564), 96 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:27,271 INFO L93 Difference]: Finished difference Result 701 states and 748 transitions. [2025-01-10 01:47:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:47:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.936842105263158) internal successors, (564), 96 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2025-01-10 01:47:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:27,274 INFO L225 Difference]: With dead ends: 701 [2025-01-10 01:47:27,274 INFO L226 Difference]: Without dead ends: 700 [2025-01-10 01:47:27,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:47:27,275 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 474 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:27,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 540 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-10 01:47:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 576. [2025-01-10 01:47:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 573 states have (on average 1.1134380453752182) internal successors, (638), 575 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 638 transitions. [2025-01-10 01:47:27,286 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 638 transitions. Word has length 283 [2025-01-10 01:47:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:27,286 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 638 transitions. [2025-01-10 01:47:27,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.936842105263158) internal successors, (564), 96 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 638 transitions. [2025-01-10 01:47:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-10 01:47:27,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:27,289 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 63, 62, 1, 1, 1, 1] [2025-01-10 01:47:27,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:27,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 01:47:27,494 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:27,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1488178044, now seen corresponding path program 5 times [2025-01-10 01:47:27,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:27,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922939275] [2025-01-10 01:47:27,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:27,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:27,503 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 381 statements into 63 equivalence classes. [2025-01-10 01:47:27,578 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 381 of 381 statements. [2025-01-10 01:47:27,578 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-01-10 01:47:27,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 0 proven. 11718 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:34,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:34,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922939275] [2025-01-10 01:47:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922939275] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:34,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919302034] [2025-01-10 01:47:34,286 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:34,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:34,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:34,292 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:34,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:47:34,341 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 381 statements into 63 equivalence classes. [2025-01-10 01:47:34,613 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 381 of 381 statements. [2025-01-10 01:47:34,614 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-01-10 01:47:34,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:34,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-01-10 01:47:34,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 0 proven. 11718 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:34,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 0 proven. 11718 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919302034] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:46,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 253 [2025-01-10 01:47:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489722451] [2025-01-10 01:47:46,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 254 states [2025-01-10 01:47:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:46,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 254 interpolants. [2025-01-10 01:47:46,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16255, Invalid=48007, Unknown=0, NotChecked=0, Total=64262 [2025-01-10 01:47:46,228 INFO L87 Difference]: Start difference. First operand 576 states and 638 transitions. Second operand has 254 states, 253 states have (on average 3.0039525691699605) internal successors, (760), 254 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:47,145 INFO L93 Difference]: Finished difference Result 929 states and 1055 transitions. [2025-01-10 01:47:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2025-01-10 01:47:47,148 INFO L78 Accepts]: Start accepts. Automaton has has 254 states, 253 states have (on average 3.0039525691699605) internal successors, (760), 254 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2025-01-10 01:47:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:47,151 INFO L225 Difference]: With dead ends: 929 [2025-01-10 01:47:47,151 INFO L226 Difference]: Without dead ends: 928 [2025-01-10 01:47:47,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19469 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=16255, Invalid=48007, Unknown=0, NotChecked=0, Total=64262 [2025-01-10 01:47:47,154 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 564 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:47,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 539 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:47:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-01-10 01:47:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 770. [2025-01-10 01:47:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 767 states have (on average 1.1277705345501956) internal successors, (865), 769 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 865 transitions. [2025-01-10 01:47:47,168 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 865 transitions. Word has length 381 [2025-01-10 01:47:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:47,169 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 865 transitions. [2025-01-10 01:47:47,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 254 states, 253 states have (on average 3.0039525691699605) internal successors, (760), 254 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:47:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 865 transitions. [2025-01-10 01:47:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-10 01:47:47,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:47,172 INFO L218 NwaCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:47,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:47:47,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:47,377 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:47:47,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash -88275741, now seen corresponding path program 6 times [2025-01-10 01:47:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-01-10 01:47:47,377 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:47:47,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:47,388 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 385 statements into 64 equivalence classes. [2025-01-10 01:47:47,452 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 385 of 385 statements. [2025-01-10 01:47:47,453 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-01-10 01:47:47,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11844 backedges. 0 proven. 11844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-01-10 01:47:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501857509] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047887956] [2025-01-10 01:47:53,513 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:47:53,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:53,516 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:47:53,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:47:53,571 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 385 statements into 64 equivalence classes. [2025-01-10 01:47:53,860 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 385 of 385 statements. [2025-01-10 01:47:53,860 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-01-10 01:47:53,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:53,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-01-10 01:47:53,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11844 backedges. 0 proven. 11844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:54,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:48:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11844 backedges. 0 proven. 11844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:03,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047887956] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:48:03,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:48:03,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128, 128] total 255 [2025-01-10 01:48:03,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064887356] [2025-01-10 01:48:03,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:48:03,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 256 states [2025-01-10 01:48:03,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:48:03,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2025-01-10 01:48:03,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16512, Invalid=48768, Unknown=0, NotChecked=0, Total=65280 [2025-01-10 01:48:03,997 INFO L87 Difference]: Start difference. First operand 770 states and 865 transitions. Second operand has 256 states, 255 states have (on average 3.011764705882353) internal successors, (768), 256 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:48:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:48:04,983 INFO L93 Difference]: Finished difference Result 936 states and 999 transitions. [2025-01-10 01:48:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2025-01-10 01:48:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 256 states, 255 states have (on average 3.011764705882353) internal successors, (768), 256 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 385 [2025-01-10 01:48:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:48:04,990 INFO L225 Difference]: With dead ends: 936 [2025-01-10 01:48:04,990 INFO L226 Difference]: Without dead ends: 807 [2025-01-10 01:48:04,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19781 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=16512, Invalid=48768, Unknown=0, NotChecked=0, Total=65280 [2025-01-10 01:48:04,993 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 576 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:48:04,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 543 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:48:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-01-10 01:48:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 772. [2025-01-10 01:48:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 769 states have (on average 1.0455136540962289) internal successors, (804), 771 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:48:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 804 transitions. [2025-01-10 01:48:05,005 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 804 transitions. Word has length 385 [2025-01-10 01:48:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:48:05,005 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 804 transitions. [2025-01-10 01:48:05,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 256 states, 255 states have (on average 3.011764705882353) internal successors, (768), 256 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:48:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 804 transitions. [2025-01-10 01:48:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-10 01:48:05,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:48:05,008 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 94, 94, 94, 1, 1, 1, 1] [2025-01-10 01:48:05,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 01:48:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:48:05,209 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:48:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:48:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1996053562, now seen corresponding path program 6 times [2025-01-10 01:48:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:48:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721144017] [2025-01-10 01:48:05,209 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:48:05,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:48:05,221 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 571 statements into 95 equivalence classes. [2025-01-10 01:48:05,386 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 571 of 571 statements. [2025-01-10 01:48:05,387 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:48:05,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:48:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 26602 backedges. 0 proven. 26602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:48:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721144017] [2025-01-10 01:48:10,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721144017] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:48:10,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328842575] [2025-01-10 01:48:10,614 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:48:10,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:48:10,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:48:10,617 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:48:10,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:48:10,743 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 571 statements into 95 equivalence classes. [2025-01-10 01:48:11,388 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 571 of 571 statements. [2025-01-10 01:48:11,389 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 01:48:11,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:48:11,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-01-10 01:48:11,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:48:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26602 backedges. 0 proven. 26602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:11,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:48:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 26602 backedges. 0 proven. 26602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:20,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328842575] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:48:20,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:48:20,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 01:48:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789955574] [2025-01-10 01:48:20,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:48:20,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 01:48:20,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:48:20,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 01:48:20,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:48:20,757 INFO L87 Difference]: Start difference. First operand 772 states and 804 transitions. Second operand has 192 states, 191 states have (on average 5.968586387434555) internal successors, (1140), 192 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:48:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:48:21,980 INFO L93 Difference]: Finished difference Result 1405 states and 1500 transitions. [2025-01-10 01:48:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 01:48:21,981 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 5.968586387434555) internal successors, (1140), 192 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 571 [2025-01-10 01:48:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:48:21,985 INFO L225 Difference]: With dead ends: 1405 [2025-01-10 01:48:21,985 INFO L226 Difference]: Without dead ends: 1404 [2025-01-10 01:48:21,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1236 GetRequests, 1046 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 01:48:21,986 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 842 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:48:21,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1051 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:48:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-01-10 01:48:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1152. [2025-01-10 01:48:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1149 states have (on average 1.112271540469974) internal successors, (1278), 1151 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:48:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1278 transitions. [2025-01-10 01:48:22,003 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1278 transitions. Word has length 571 [2025-01-10 01:48:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:48:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1278 transitions. [2025-01-10 01:48:22,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 5.968586387434555) internal successors, (1140), 192 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:48:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1278 transitions. [2025-01-10 01:48:22,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-01-10 01:48:22,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:48:22,007 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 127, 127, 126, 1, 1, 1, 1] [2025-01-10 01:48:22,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 01:48:22,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:48:22,211 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:48:22,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:48:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2020758212, now seen corresponding path program 6 times [2025-01-10 01:48:22,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:48:22,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-01-10 01:48:22,211 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:48:22,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:48:22,225 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 765 statements into 127 equivalence classes. [2025-01-10 01:48:22,427 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) and asserted 765 of 765 statements. [2025-01-10 01:48:22,427 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2025-01-10 01:48:22,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat