./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark41_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/benchmark41_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 e8c2a2f5606e46c1a328e1728dc6cdf6823e5c50ed56fab8310a8cb7bd30fe62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:47:04,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:47:04,799 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:47:04,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:47:04,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:47:04,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:47:04,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:47:04,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:47:04,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:47:04,834 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:47:04,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:47:04,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:47:04,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:47:04,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:47:04,836 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:47:04,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:47:04,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:47:04,837 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:47:04,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:47:04,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:47:04,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:47:04,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:47:04,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:47:04,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:47:04,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:47:04,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:47:04,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:47:04,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:47:04,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:47:04,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:47:04,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:47:04,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:47:04,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:47:04,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:47:04,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:47:04,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:47:04,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:47:04,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:47:04,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:47:04,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:47:04,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:47:04,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:47:04,841 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 -> e8c2a2f5606e46c1a328e1728dc6cdf6823e5c50ed56fab8310a8cb7bd30fe62 [2025-01-10 01:47:05,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:47:05,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:47:05,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:47:05,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:47:05,127 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:47:05,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark41_conjunctive.i [2025-01-10 01:47:06,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50e25e924/5f7671362c0f4373b7ef3c9c5f0767bc/FLAG9e6d101ef [2025-01-10 01:47:06,741 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:47:06,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark41_conjunctive.i [2025-01-10 01:47:06,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50e25e924/5f7671362c0f4373b7ef3c9c5f0767bc/FLAG9e6d101ef [2025-01-10 01:47:07,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50e25e924/5f7671362c0f4373b7ef3c9c5f0767bc [2025-01-10 01:47:07,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:47:07,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:47:07,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:47:07,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:47:07,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:47:07,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:47:07" (1/1) ... [2025-01-10 01:47:07,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526bdd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:07, skipping insertion in model container [2025-01-10 01:47:07,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:47:07" (1/1) ... [2025-01-10 01:47:07,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:47:07,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:47:07,179 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:47:07,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:47:07,206 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:47:07,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:07 WrapperNode [2025-01-10 01:47:07,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:47:07,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:47:07,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:47:07,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:47:07,215 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:07" (1/1) ... [2025-01-10 01:47:07,220 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:07" (1/1) ... [2025-01-10 01:47:07,237 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-01-10 01:47:07,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:47:07,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:47:07,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:47:07,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:47:07,246 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:07" (1/1) ... [2025-01-10 01:47:07,248 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:07" (1/1) ... [2025-01-10 01:47:07,249 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:07" (1/1) ... [2025-01-10 01:47:07,261 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:07,261 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:07" (1/1) ... [2025-01-10 01:47:07,262 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:07" (1/1) ... [2025-01-10 01:47:07,265 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:07" (1/1) ... [2025-01-10 01:47:07,267 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:07" (1/1) ... [2025-01-10 01:47:07,270 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:07" (1/1) ... [2025-01-10 01:47:07,272 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:07" (1/1) ... [2025-01-10 01:47:07,273 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:07" (1/1) ... [2025-01-10 01:47:07,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:47:07,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:47:07,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:47:07,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:47:07,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:07" (1/1) ... [2025-01-10 01:47:07,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:47:07,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:07,307 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:07,310 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:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:47:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:47:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:47:07,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:47:07,375 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:47:07,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:47:07,503 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-10 01:47:07,503 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:47:07,514 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:47:07,514 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:47:07,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:47:07 BoogieIcfgContainer [2025-01-10 01:47:07,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:47:07,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:47:07,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:47:07,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:47:07,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:47:07" (1/3) ... [2025-01-10 01:47:07,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddf2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:47:07, skipping insertion in model container [2025-01-10 01:47:07,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:47:07" (2/3) ... [2025-01-10 01:47:07,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddf2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:47:07, skipping insertion in model container [2025-01-10 01:47:07,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:47:07" (3/3) ... [2025-01-10 01:47:07,524 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark41_conjunctive.i [2025-01-10 01:47:07,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:47:07,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark41_conjunctive.i that has 1 procedures, 36 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-01-10 01:47:07,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:47:07,599 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;@21eb54f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:47:07,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:47:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.64) internal successors, (41), 35 states have internal predecessors, (41), 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:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:47:07,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:07,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:07,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1807520455, now seen corresponding path program 1 times [2025-01-10 01:47:07,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:07,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374022335] [2025-01-10 01:47:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:07,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:47:07,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:47:07,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:07,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:07,722 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:07,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374022335] [2025-01-10 01:47:07,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374022335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:07,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:07,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263958070] [2025-01-10 01:47:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:07,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:47:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:07,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:47:07,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:47:07,748 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.64) internal successors, (41), 35 states have internal predecessors, (41), 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 3.5) internal successors, (7), 2 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:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:07,762 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-01-10 01:47:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:47:07,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:07,769 INFO L225 Difference]: With dead ends: 53 [2025-01-10 01:47:07,770 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 01:47:07,772 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:07,777 INFO L435 NwaCegarLoop]: 37 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, 37 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:07,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 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:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 01:47:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 01:47:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 27 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:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-01-10 01:47:07,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 7 [2025-01-10 01:47:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:07,810 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-01-10 01:47:07,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-01-10 01:47:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:47:07,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:07,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:07,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:47:07,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:07,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875016, now seen corresponding path program 1 times [2025-01-10 01:47:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539315371] [2025-01-10 01:47:07,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:07,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:07,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:47:07,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:47:07,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:07,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:07,945 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:07,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539315371] [2025-01-10 01:47:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539315371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:07,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:07,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899406964] [2025-01-10 01:47:07,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:07,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:07,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:07,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:07,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:07,949 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,006 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2025-01-10 01:47:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,007 INFO L225 Difference]: With dead ends: 28 [2025-01-10 01:47:08,007 INFO L226 Difference]: Without dead ends: 27 [2025-01-10 01:47:08,007 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:08,008 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 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.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-10 01:47:08,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-10 01:47:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 26 states have internal predecessors, (27), 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,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-01-10 01:47:08,014 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 7 [2025-01-10 01:47:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,014 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-01-10 01:47:08,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-01-10 01:47:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:47:08,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:47:08,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:08,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash 178626202, now seen corresponding path program 1 times [2025-01-10 01:47:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245917431] [2025-01-10 01:47:08,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:47:08,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:47:08,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:08,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,141 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:08,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245917431] [2025-01-10 01:47:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245917431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:08,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:08,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:47:08,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623084865] [2025-01-10 01:47:08,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:08,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:47:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:08,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:47:08,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:47:08,143 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,200 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-01-10 01:47:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:47:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,202 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:47:08,202 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:47:08,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:47:08,203 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:47:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2025-01-10 01:47:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 25 states have internal predecessors, (26), 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,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-01-10 01:47:08,206 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 8 [2025-01-10 01:47:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,207 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-01-10 01:47:08,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-01-10 01:47:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:47:08,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:47:08,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:08,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,208 INFO L85 PathProgramCache]: Analyzing trace with hash 178550700, now seen corresponding path program 1 times [2025-01-10 01:47:08,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133359742] [2025-01-10 01:47:08,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:08,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:47:08,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:47:08,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:08,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,265 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:08,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133359742] [2025-01-10 01:47:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133359742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:08,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054048453] [2025-01-10 01:47:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:08,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:08,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:08,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:08,267 INFO L87 Difference]: Start difference. First operand 26 states and 26 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:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,301 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2025-01-10 01:47:08,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:08,302 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:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,303 INFO L225 Difference]: With dead ends: 38 [2025-01-10 01:47:08,303 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:47:08,303 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:08,304 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:47:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2025-01-10 01:47:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 30 states have internal predecessors, (32), 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,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-01-10 01:47:08,312 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 8 [2025-01-10 01:47:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,313 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-01-10 01:47:08,313 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:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-01-10 01:47:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:47:08,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:47:08,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:08,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1242445037, now seen corresponding path program 1 times [2025-01-10 01:47:08,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722015464] [2025-01-10 01:47:08,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:08,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:47:08,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:47:08,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:08,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,373 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:08,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722015464] [2025-01-10 01:47:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722015464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:08,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144329394] [2025-01-10 01:47:08,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:08,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:08,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:08,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:08,376 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,433 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-01-10 01:47:08,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:08,433 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:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,434 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:47:08,434 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:47:08,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:47:08,435 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:47:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-10 01:47:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 34 states have internal predecessors, (36), 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,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-01-10 01:47:08,443 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 9 [2025-01-10 01:47:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,443 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-01-10 01:47:08,443 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:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-01-10 01:47:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:47:08,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:47:08,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:08,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1240104458, now seen corresponding path program 1 times [2025-01-10 01:47:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368751159] [2025-01-10 01:47:08,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:47:08,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:47:08,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:08,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,514 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:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368751159] [2025-01-10 01:47:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368751159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:08,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272643336] [2025-01-10 01:47:08,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:08,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:08,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:08,530 INFO L87 Difference]: Start difference. First operand 35 states and 36 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:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,565 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-01-10 01:47:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:08,566 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:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,566 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:47:08,568 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:47:08,568 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:08,568 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:47:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:47:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 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,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-01-10 01:47:08,579 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 9 [2025-01-10 01:47:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,579 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-01-10 01:47:08,579 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:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-01-10 01:47:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:47:08,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:47:08,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:08,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash -138909444, now seen corresponding path program 1 times [2025-01-10 01:47:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53163898] [2025-01-10 01:47:08,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:08,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:47:08,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:47:08,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:08,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,677 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:08,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:08,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53163898] [2025-01-10 01:47:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53163898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:08,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:08,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:47:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848892264] [2025-01-10 01:47:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:47:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:08,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:47:08,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:47:08,681 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,767 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-01-10 01:47:08,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-01-10 01:47:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,768 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:47:08,768 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:47:08,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:47:08,770 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 45 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:47:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-01-10 01:47:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 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,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-01-10 01:47:08,774 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 10 [2025-01-10 01:47:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,775 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-01-10 01:47:08,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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,775 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-01-10 01:47:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:47:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:47:08,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:08,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -211467410, now seen corresponding path program 1 times [2025-01-10 01:47:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364737577] [2025-01-10 01:47:08,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:47:08,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:47:08,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:08,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,826 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:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364737577] [2025-01-10 01:47:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364737577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:08,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593572743] [2025-01-10 01:47:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:08,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:08,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:08,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:08,828 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,859 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2025-01-10 01:47:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:08,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-01-10 01:47:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,861 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:47:08,861 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:47:08,861 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:08,862 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:47:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-01-10 01:47:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 36 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:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-01-10 01:47:08,867 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 10 [2025-01-10 01:47:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,868 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-01-10 01:47:08,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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,868 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-01-10 01:47:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:47:08,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:47:08,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:08,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash -11225393, now seen corresponding path program 1 times [2025-01-10 01:47:08,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157261485] [2025-01-10 01:47:08,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:47:08,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:47:08,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:08,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:08,909 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:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157261485] [2025-01-10 01:47:08,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157261485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:08,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:08,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:47:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792309626] [2025-01-10 01:47:08,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:08,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:47:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:08,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:47:08,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:47:08,911 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:08,955 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2025-01-10 01:47:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:47:08,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-01-10 01:47:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:08,956 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:47:08,956 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:47:08,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:47:08,957 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:08,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:47:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:47:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 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,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2025-01-10 01:47:08,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 11 [2025-01-10 01:47:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:08,967 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2025-01-10 01:47:08,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2025-01-10 01:47:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:47:08,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:08,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:08,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:47:08,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:08,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2034444940, now seen corresponding path program 1 times [2025-01-10 01:47:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925683278] [2025-01-10 01:47:08,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:08,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:47:08,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:47:08,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:08,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:09,009 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:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925683278] [2025-01-10 01:47:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925683278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:09,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:09,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:09,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496174308] [2025-01-10 01:47:09,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:09,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:09,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:09,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:09,010 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:09,024 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-01-10 01:47:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-01-10 01:47:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:09,025 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:47:09,025 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:47:09,025 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:09,025 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:09,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:47:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-01-10 01:47:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 32 states have internal predecessors, (33), 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:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2025-01-10 01:47:09,029 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 11 [2025-01-10 01:47:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:09,029 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2025-01-10 01:47:09,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2025-01-10 01:47:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:47:09,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:09,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:09,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:47:09,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:09,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1356716240, now seen corresponding path program 1 times [2025-01-10 01:47:09,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949376700] [2025-01-10 01:47:09,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:09,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:09,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:47:09,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:47:09,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:09,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:09,053 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:09,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:09,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949376700] [2025-01-10 01:47:09,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949376700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:09,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:47:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164021564] [2025-01-10 01:47:09,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:47:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:09,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:47:09,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:47:09,055 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:09,067 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2025-01-10 01:47:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:47:09,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-01-10 01:47:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:09,068 INFO L225 Difference]: With dead ends: 33 [2025-01-10 01:47:09,068 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:47:09,068 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:09,069 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:09,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:47:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:47:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 31 states have internal predecessors, (32), 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:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2025-01-10 01:47:09,072 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 12 [2025-01-10 01:47:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:09,073 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2025-01-10 01:47:09,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2025-01-10 01:47:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:47:09,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:09,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:09,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:47:09,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:09,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1465734463, now seen corresponding path program 1 times [2025-01-10 01:47:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289308163] [2025-01-10 01:47:09,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:09,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:47:09,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:47:09,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:09,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:09,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:09,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289308163] [2025-01-10 01:47:09,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289308163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:09,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472557700] [2025-01-10 01:47:09,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:09,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:09,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:09,143 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:09,144 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:09,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:47:09,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:47:09,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:09,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:09,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:47:09,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:09,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472557700] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:09,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:09,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-10 01:47:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409318915] [2025-01-10 01:47:09,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:09,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:47:09,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:09,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:47:09,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:47:09,295 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:09,361 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2025-01-10 01:47:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:47:09,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 17 [2025-01-10 01:47:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:09,363 INFO L225 Difference]: With dead ends: 79 [2025-01-10 01:47:09,363 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:47:09,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:47:09,364 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:09,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 78 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:47:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2025-01-10 01:47:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.26) internal successors, (63), 55 states have internal predecessors, (63), 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:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-01-10 01:47:09,374 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 17 [2025-01-10 01:47:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:09,376 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-01-10 01:47:09,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-01-10 01:47:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:47:09,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:09,377 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:09,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:47:09,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:47:09,578 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:09,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1804531270, now seen corresponding path program 1 times [2025-01-10 01:47:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:09,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950766649] [2025-01-10 01:47:09,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:09,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:47:09,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:47:09,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:09,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:09,685 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:09,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950766649] [2025-01-10 01:47:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950766649] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309036332] [2025-01-10 01:47:09,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:09,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:09,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:09,688 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:09,691 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:09,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:47:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:47:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:09,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:47:09,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:09,849 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:09,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:09,918 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:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309036332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:09,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 01:47:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096369194] [2025-01-10 01:47:09,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:09,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:47:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:09,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:47:09,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:47:09,920 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 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,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:10,014 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2025-01-10 01:47:10,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:47:10,015 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 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 18 [2025-01-10 01:47:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:10,015 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:47:10,015 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 01:47:10,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:47:10,017 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:10,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 01:47:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2025-01-10 01:47:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 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,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2025-01-10 01:47:10,028 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2025-01-10 01:47:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:10,028 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2025-01-10 01:47:10,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 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,029 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2025-01-10 01:47:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:47:10,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:10,029 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:10,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:47:10,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:10,230 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:10,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -105894449, now seen corresponding path program 1 times [2025-01-10 01:47:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:10,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419699316] [2025-01-10 01:47:10,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:10,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:47:10,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:47:10,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:10,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:10,338 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:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:10,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419699316] [2025-01-10 01:47:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419699316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457259480] [2025-01-10 01:47:10,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:10,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:10,341 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:10,344 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:10,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:47:10,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:47:10,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:10,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:10,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:47:10,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:10,573 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:10,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:47:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457259480] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:10,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:47:10,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 16 [2025-01-10 01:47:10,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540012713] [2025-01-10 01:47:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:10,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:47:10,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:10,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:47:10,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:47:10,683 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:10,736 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-01-10 01:47:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:47:10,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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) Word has length 19 [2025-01-10 01:47:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:10,737 INFO L225 Difference]: With dead ends: 60 [2025-01-10 01:47:10,737 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 01:47:10,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:47:10,738 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:10,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 01:47:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-10 01:47:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 58 states have internal predecessors, (66), 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,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-01-10 01:47:10,747 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 19 [2025-01-10 01:47:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-01-10 01:47:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-01-10 01:47:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:47:10,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:10,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:10,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:47:10,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:10,950 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:10,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:10,950 INFO L85 PathProgramCache]: Analyzing trace with hash -178452415, now seen corresponding path program 1 times [2025-01-10 01:47:10,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:10,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141305779] [2025-01-10 01:47:10,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:10,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:10,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:47:10,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:47:10,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:10,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:11,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:11,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141305779] [2025-01-10 01:47:11,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141305779] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:11,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371021731] [2025-01-10 01:47:11,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:11,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:11,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:11,017 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:11,020 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:11,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:47:11,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:47:11,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:11,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:11,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:47:11,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:11,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371021731] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:11,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:11,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-10 01:47:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63382561] [2025-01-10 01:47:11,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:11,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:47:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:11,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:47:11,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:47:11,134 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:11,200 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-01-10 01:47:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:47:11,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 19 [2025-01-10 01:47:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:11,202 INFO L225 Difference]: With dead ends: 78 [2025-01-10 01:47:11,202 INFO L226 Difference]: Without dead ends: 77 [2025-01-10 01:47:11,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:47:11,202 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:11,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 92 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-10 01:47:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2025-01-10 01:47:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 60 states have internal predecessors, (66), 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,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2025-01-10 01:47:11,207 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2025-01-10 01:47:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:11,207 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2025-01-10 01:47:11,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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,208 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2025-01-10 01:47:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:47:11,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:11,208 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:11,216 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:11,409 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,SelfDestructingSolverStorable14 [2025-01-10 01:47:11,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:11,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:11,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1012239452, now seen corresponding path program 1 times [2025-01-10 01:47:11,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:11,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601149922] [2025-01-10 01:47:11,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:11,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:47:11,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:47:11,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:11,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:47:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601149922] [2025-01-10 01:47:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601149922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:47:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:47:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:47:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524057042] [2025-01-10 01:47:11,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:47:11,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:47:11,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:11,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:47:11,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:47:11,473 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:11,512 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2025-01-10 01:47:11,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:47:11,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 20 [2025-01-10 01:47:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:11,513 INFO L225 Difference]: With dead ends: 61 [2025-01-10 01:47:11,513 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 01:47:11,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:47:11,514 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:11,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 01:47:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-10 01:47:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 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,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2025-01-10 01:47:11,522 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 20 [2025-01-10 01:47:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:11,522 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2025-01-10 01:47:11,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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,522 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2025-01-10 01:47:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:47:11,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:11,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:11,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:47:11,522 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1237057511, now seen corresponding path program 1 times [2025-01-10 01:47:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189982985] [2025-01-10 01:47:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:11,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:47:11,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:47:11,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:11,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189982985] [2025-01-10 01:47:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189982985] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284698714] [2025-01-10 01:47:11,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:47:11,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:11,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:11,571 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:11,573 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:11,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:47:11,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:47:11,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:47:11,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:11,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:47:11,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:11,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284698714] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:11,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:47:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265821985] [2025-01-10 01:47:11,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:11,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:47:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:11,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:47:11,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:47:11,671 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 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:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:11,689 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-01-10 01:47:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:47:11,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 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) Word has length 20 [2025-01-10 01:47:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:11,690 INFO L225 Difference]: With dead ends: 61 [2025-01-10 01:47:11,690 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 01:47:11,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 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:11,691 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:11,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 01:47:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2025-01-10 01:47:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 54 states have internal predecessors, (56), 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,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2025-01-10 01:47:11,698 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 20 [2025-01-10 01:47:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:11,698 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2025-01-10 01:47:11,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 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:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2025-01-10 01:47:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 01:47:11,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:11,700 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:11,707 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:11,900 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,SelfDestructingSolverStorable16 [2025-01-10 01:47:11,901 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:11,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1225942810, now seen corresponding path program 2 times [2025-01-10 01:47:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991954783] [2025-01-10 01:47:11,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:11,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 01:47:11,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:47:11,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:11,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:12,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:12,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991954783] [2025-01-10 01:47:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991954783] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458843884] [2025-01-10 01:47:12,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:12,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:12,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:12,118 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:12,120 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:12,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 01:47:12,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:47:12,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:12,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:12,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:47:12,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:12,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458843884] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:12,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-01-10 01:47:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68609884] [2025-01-10 01:47:12,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:12,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 01:47:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:12,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 01:47:12,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:47:12,584 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 32 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 32 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:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:12,753 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2025-01-10 01:47:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:47:12,754 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 32 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) Word has length 36 [2025-01-10 01:47:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:12,755 INFO L225 Difference]: With dead ends: 98 [2025-01-10 01:47:12,755 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 01:47:12,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:47:12,756 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:12,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 01:47:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2025-01-10 01:47:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 75 states have internal predecessors, (82), 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:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-01-10 01:47:12,764 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 36 [2025-01-10 01:47:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:12,764 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-01-10 01:47:12,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 32 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:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-01-10 01:47:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 01:47:12,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:12,765 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-01-10 01:47:12,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:47:12,969 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,SelfDestructingSolverStorable17 [2025-01-10 01:47:12,969 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2145973652, now seen corresponding path program 2 times [2025-01-10 01:47:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:12,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067037766] [2025-01-10 01:47:12,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:12,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 01:47:12,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:47:12,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:12,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:13,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:13,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067037766] [2025-01-10 01:47:13,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067037766] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:13,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212004690] [2025-01-10 01:47:13,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:13,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:13,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:13,192 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:13,194 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:13,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 01:47:13,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:47:13,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:13,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:13,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:47:13,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:13,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:13,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212004690] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:13,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:13,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-01-10 01:47:13,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805492233] [2025-01-10 01:47:13,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:13,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:47:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:13,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:47:13,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:47:13,456 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 22 states, 21 states have (on average 4.095238095238095) internal successors, (86), 22 states have internal predecessors, (86), 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:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:13,527 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2025-01-10 01:47:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:47:13,527 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.095238095238095) internal successors, (86), 22 states have internal predecessors, (86), 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 44 [2025-01-10 01:47:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:13,528 INFO L225 Difference]: With dead ends: 129 [2025-01-10 01:47:13,528 INFO L226 Difference]: Without dead ends: 128 [2025-01-10 01:47:13,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:47:13,529 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 56 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:13,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 140 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-10 01:47:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2025-01-10 01:47:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 105 states have internal predecessors, (119), 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:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2025-01-10 01:47:13,535 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 44 [2025-01-10 01:47:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:13,536 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2025-01-10 01:47:13,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.095238095238095) internal successors, (86), 22 states have internal predecessors, (86), 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:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2025-01-10 01:47:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 01:47:13,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:13,537 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-01-10 01:47:13,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:47:13,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:13,741 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:13,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash -696375762, now seen corresponding path program 2 times [2025-01-10 01:47:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:13,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523964989] [2025-01-10 01:47:13,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:13,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 01:47:13,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:47:13,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:13,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523964989] [2025-01-10 01:47:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523964989] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335775790] [2025-01-10 01:47:13,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:13,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:13,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:13,904 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:13,906 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:13,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-10 01:47:13,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:47:13,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:13,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:13,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:47:13,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:13,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335775790] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:14,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-01-10 01:47:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782127574] [2025-01-10 01:47:14,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:14,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:47:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:14,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:47:14,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:47:14,173 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 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:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:14,240 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2025-01-10 01:47:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:47:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 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 46 [2025-01-10 01:47:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:14,242 INFO L225 Difference]: With dead ends: 126 [2025-01-10 01:47:14,242 INFO L226 Difference]: Without dead ends: 125 [2025-01-10 01:47:14,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:47:14,243 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:14,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-10 01:47:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2025-01-10 01:47:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 107 states have internal predecessors, (116), 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:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2025-01-10 01:47:14,249 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 46 [2025-01-10 01:47:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:14,250 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2025-01-10 01:47:14,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 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:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2025-01-10 01:47:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 01:47:14,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:14,251 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-01-10 01:47:14,259 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:14,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:14,454 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:14,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash -112812084, now seen corresponding path program 2 times [2025-01-10 01:47:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582703946] [2025-01-10 01:47:14,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:14,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-10 01:47:14,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:47:14,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:14,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:14,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:14,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582703946] [2025-01-10 01:47:14,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582703946] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:14,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906689065] [2025-01-10 01:47:14,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:47:14,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:14,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:14,539 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:14,541 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:14,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-10 01:47:14,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:47:14,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:47:14,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:14,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:47:14,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:14,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:14,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906689065] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:14,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:14,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:47:14,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578298674] [2025-01-10 01:47:14,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:14,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:47:14,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:14,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:47:14,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:47:14,755 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 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:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:14,802 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2025-01-10 01:47:14,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:47:14,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 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 47 [2025-01-10 01:47:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:14,803 INFO L225 Difference]: With dead ends: 125 [2025-01-10 01:47:14,803 INFO L226 Difference]: Without dead ends: 124 [2025-01-10 01:47:14,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:47:14,804 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:14,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 133 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-10 01:47:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2025-01-10 01:47:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.0666666666666667) internal successors, (112), 108 states have internal predecessors, (112), 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:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2025-01-10 01:47:14,810 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 47 [2025-01-10 01:47:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:14,810 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2025-01-10 01:47:14,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 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:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2025-01-10 01:47:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 01:47:14,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:14,811 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:14,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:47:15,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:15,011 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:15,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1950262822, now seen corresponding path program 3 times [2025-01-10 01:47:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:15,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958763200] [2025-01-10 01:47:15,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:15,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:15,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 8 equivalence classes. [2025-01-10 01:47:15,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:47:15,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:47:15,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:15,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:15,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958763200] [2025-01-10 01:47:15,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958763200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:15,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863024214] [2025-01-10 01:47:15,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:15,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:15,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:15,406 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:15,408 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:15,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 8 equivalence classes. [2025-01-10 01:47:15,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:47:15,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:47:15,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:15,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 01:47:15,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:15,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:16,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863024214] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:16,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:16,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 63 [2025-01-10 01:47:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186085285] [2025-01-10 01:47:16,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:16,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-01-10 01:47:16,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:16,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-01-10 01:47:16,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=3421, Unknown=0, NotChecked=0, Total=4032 [2025-01-10 01:47:16,559 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 64 states, 63 states have (on average 3.365079365079365) internal successors, (212), 64 states have internal predecessors, (212), 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:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:16,797 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2025-01-10 01:47:16,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-10 01:47:16,797 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.365079365079365) internal successors, (212), 64 states have internal predecessors, (212), 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 72 [2025-01-10 01:47:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:16,798 INFO L225 Difference]: With dead ends: 188 [2025-01-10 01:47:16,798 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 01:47:16,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=673, Invalid=3749, Unknown=0, NotChecked=0, Total=4422 [2025-01-10 01:47:16,802 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:16,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 204 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:47:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 01:47:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2025-01-10 01:47:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 147 states have internal predecessors, (160), 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:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2025-01-10 01:47:16,810 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 72 [2025-01-10 01:47:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:16,810 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2025-01-10 01:47:16,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.365079365079365) internal successors, (212), 64 states have internal predecessors, (212), 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:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2025-01-10 01:47:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 01:47:16,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:16,811 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-01-10 01:47:16,819 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:17,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:17,012 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:17,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1925542540, now seen corresponding path program 3 times [2025-01-10 01:47:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:17,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310746365] [2025-01-10 01:47:17,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:17,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 11 equivalence classes. [2025-01-10 01:47:17,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 01:47:17,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:47:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:17,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:17,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310746365] [2025-01-10 01:47:17,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310746365] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:17,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7536125] [2025-01-10 01:47:17,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:17,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:17,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:17,563 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:17,566 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:17,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 11 equivalence classes. [2025-01-10 01:47:17,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 01:47:17,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:47:17,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:17,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:47:17,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:17,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7536125] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:18,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:18,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-01-10 01:47:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068833806] [2025-01-10 01:47:18,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:18,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-10 01:47:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:18,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-10 01:47:18,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 01:47:18,313 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand has 46 states, 45 states have (on average 4.311111111111111) internal successors, (194), 46 states have internal predecessors, (194), 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:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:18,426 INFO L93 Difference]: Finished difference Result 265 states and 283 transitions. [2025-01-10 01:47:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-10 01:47:18,426 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 4.311111111111111) internal successors, (194), 46 states have internal predecessors, (194), 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 98 [2025-01-10 01:47:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:18,427 INFO L225 Difference]: With dead ends: 265 [2025-01-10 01:47:18,427 INFO L226 Difference]: Without dead ends: 264 [2025-01-10 01:47:18,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 01:47:18,428 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 132 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:18,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 244 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-10 01:47:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 214. [2025-01-10 01:47:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 210 states have (on average 1.1571428571428573) internal successors, (243), 213 states have internal predecessors, (243), 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:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 243 transitions. [2025-01-10 01:47:18,437 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 243 transitions. Word has length 98 [2025-01-10 01:47:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:18,438 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 243 transitions. [2025-01-10 01:47:18,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.311111111111111) internal successors, (194), 46 states have internal predecessors, (194), 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:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 243 transitions. [2025-01-10 01:47:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 01:47:18,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:18,439 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-01-10 01:47:18,446 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:18,642 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,SelfDestructingSolverStorable22 [2025-01-10 01:47:18,642 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:18,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:18,642 INFO L85 PathProgramCache]: Analyzing trace with hash -684521906, now seen corresponding path program 3 times [2025-01-10 01:47:18,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:18,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842167906] [2025-01-10 01:47:18,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:18,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:18,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 11 equivalence classes. [2025-01-10 01:47:18,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 01:47:18,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:47:18,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842167906] [2025-01-10 01:47:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842167906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743953315] [2025-01-10 01:47:19,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:19,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:19,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:19,166 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:19,169 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:19,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 11 equivalence classes. [2025-01-10 01:47:19,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 01:47:19,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:47:19,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:19,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:47:19,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:19,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:19,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743953315] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:19,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:19,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-01-10 01:47:19,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579572771] [2025-01-10 01:47:19,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:19,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-10 01:47:19,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:19,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-10 01:47:19,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 01:47:19,970 INFO L87 Difference]: Start difference. First operand 214 states and 243 transitions. Second operand has 46 states, 45 states have (on average 4.4) internal successors, (198), 46 states have internal predecessors, (198), 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:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:20,111 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2025-01-10 01:47:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-10 01:47:20,112 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 4.4) internal successors, (198), 46 states have internal predecessors, (198), 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 100 [2025-01-10 01:47:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:20,113 INFO L225 Difference]: With dead ends: 256 [2025-01-10 01:47:20,113 INFO L226 Difference]: Without dead ends: 255 [2025-01-10 01:47:20,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 01:47:20,114 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:20,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 280 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-10 01:47:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 216. [2025-01-10 01:47:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 212 states have (on average 1.1037735849056605) internal successors, (234), 215 states have internal predecessors, (234), 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:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 234 transitions. [2025-01-10 01:47:20,126 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 234 transitions. Word has length 100 [2025-01-10 01:47:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:20,127 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 234 transitions. [2025-01-10 01:47:20,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.4) internal successors, (198), 46 states have internal predecessors, (198), 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:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 234 transitions. [2025-01-10 01:47:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 01:47:20,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:20,128 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2025-01-10 01:47:20,136 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:20,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:20,332 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:20,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 254657452, now seen corresponding path program 3 times [2025-01-10 01:47:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:20,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145780069] [2025-01-10 01:47:20,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:20,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:20,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 101 statements into 11 equivalence classes. [2025-01-10 01:47:20,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 01:47:20,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:47:20,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145780069] [2025-01-10 01:47:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145780069] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666647062] [2025-01-10 01:47:20,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:47:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:20,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:20,551 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:20,553 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:20,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 101 statements into 11 equivalence classes. [2025-01-10 01:47:20,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 01:47:20,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:47:20,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:20,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:47:20,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:20,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:21,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666647062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:21,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:21,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:47:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352573523] [2025-01-10 01:47:21,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:21,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:47:21,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:21,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:47:21,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:47:21,034 INFO L87 Difference]: Start difference. First operand 216 states and 234 transitions. Second operand has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 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:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:21,100 INFO L93 Difference]: Finished difference Result 253 states and 264 transitions. [2025-01-10 01:47:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:47:21,101 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 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 101 [2025-01-10 01:47:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:21,102 INFO L225 Difference]: With dead ends: 253 [2025-01-10 01:47:21,102 INFO L226 Difference]: Without dead ends: 252 [2025-01-10 01:47:21,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 190 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:21,103 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 67 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:21,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 223 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:47:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-10 01:47:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 217. [2025-01-10 01:47:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 213 states have (on average 1.051643192488263) internal successors, (224), 216 states have internal predecessors, (224), 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:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 224 transitions. [2025-01-10 01:47:21,112 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 224 transitions. Word has length 101 [2025-01-10 01:47:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:21,112 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 224 transitions. [2025-01-10 01:47:21,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 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:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 224 transitions. [2025-01-10 01:47:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-10 01:47:21,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:21,113 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:21,125 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:21,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:21,314 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:21,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1053286566, now seen corresponding path program 4 times [2025-01-10 01:47:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:21,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896610238] [2025-01-10 01:47:21,315 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:21,321 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 144 statements into 2 equivalence classes. [2025-01-10 01:47:21,336 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 01:47:21,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:21,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:22,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:22,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896610238] [2025-01-10 01:47:22,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896610238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:22,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133502037] [2025-01-10 01:47:22,378 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:22,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:22,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:22,381 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:22,383 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:22,427 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 144 statements into 2 equivalence classes. [2025-01-10 01:47:22,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 01:47:22,463 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:22,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:22,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-10 01:47:22,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:23,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133502037] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:25,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 47, 47] total 127 [2025-01-10 01:47:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882406809] [2025-01-10 01:47:25,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:25,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-01-10 01:47:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:25,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-01-10 01:47:25,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2366, Invalid=13890, Unknown=0, NotChecked=0, Total=16256 [2025-01-10 01:47:25,024 INFO L87 Difference]: Start difference. First operand 217 states and 224 transitions. Second operand has 128 states, 127 states have (on average 3.37007874015748) internal successors, (428), 128 states have internal predecessors, (428), 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:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:25,432 INFO L93 Difference]: Finished difference Result 368 states and 397 transitions. [2025-01-10 01:47:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-01-10 01:47:25,432 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 3.37007874015748) internal successors, (428), 128 states have internal predecessors, (428), 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 144 [2025-01-10 01:47:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:25,434 INFO L225 Difference]: With dead ends: 368 [2025-01-10 01:47:25,434 INFO L226 Difference]: Without dead ends: 303 [2025-01-10 01:47:25,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10255 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2424, Invalid=14346, Unknown=0, NotChecked=0, Total=16770 [2025-01-10 01:47:25,438 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 154 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:25,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 288 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:47:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-10 01:47:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2025-01-10 01:47:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 288 states have (on average 1.0972222222222223) internal successors, (316), 291 states have internal predecessors, (316), 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:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2025-01-10 01:47:25,449 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 144 [2025-01-10 01:47:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:25,450 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2025-01-10 01:47:25,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 3.37007874015748) internal successors, (428), 128 states have internal predecessors, (428), 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:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2025-01-10 01:47:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-10 01:47:25,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:25,451 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1] [2025-01-10 01:47:25,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 01:47:25,656 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,SelfDestructingSolverStorable25 [2025-01-10 01:47:25,656 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:25,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash 320486092, now seen corresponding path program 4 times [2025-01-10 01:47:25,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:25,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488882094] [2025-01-10 01:47:25,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:25,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:25,667 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 206 statements into 2 equivalence classes. [2025-01-10 01:47:25,708 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 206 of 206 statements. [2025-01-10 01:47:25,709 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:25,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488882094] [2025-01-10 01:47:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488882094] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947061705] [2025-01-10 01:47:27,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:27,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:27,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:27,357 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:27,358 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:27,392 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 206 statements into 2 equivalence classes. [2025-01-10 01:47:27,431 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 206 of 206 statements. [2025-01-10 01:47:27,431 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:27,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:27,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:47:27,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:27,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 2189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947061705] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:29,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:29,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 95 [2025-01-10 01:47:29,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342644659] [2025-01-10 01:47:29,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:29,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:47:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:29,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:47:29,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:47:29,339 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand has 96 states, 95 states have (on average 4.378947368421053) internal successors, (416), 96 states have internal predecessors, (416), 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:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:29,685 INFO L93 Difference]: Finished difference Result 537 states and 575 transitions. [2025-01-10 01:47:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-01-10 01:47:29,686 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.378947368421053) internal successors, (416), 96 states have internal predecessors, (416), 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 206 [2025-01-10 01:47:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:29,688 INFO L225 Difference]: With dead ends: 537 [2025-01-10 01:47:29,689 INFO L226 Difference]: Without dead ends: 536 [2025-01-10 01:47:29,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:47:29,690 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 220 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:29,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 457 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:47:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-10 01:47:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 430. [2025-01-10 01:47:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 426 states have (on average 1.1525821596244132) internal successors, (491), 429 states have internal predecessors, (491), 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:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 491 transitions. [2025-01-10 01:47:29,708 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 491 transitions. Word has length 206 [2025-01-10 01:47:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:29,708 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 491 transitions. [2025-01-10 01:47:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.378947368421053) internal successors, (416), 96 states have internal predecessors, (416), 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:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 491 transitions. [2025-01-10 01:47:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-10 01:47:29,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:29,711 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-01-10 01:47:29,719 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:29,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-10 01:47:29,911 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:29,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:29,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1250509170, now seen corresponding path program 4 times [2025-01-10 01:47:29,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:29,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129396808] [2025-01-10 01:47:29,912 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:29,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:29,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 208 statements into 2 equivalence classes. [2025-01-10 01:47:29,963 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 208 of 208 statements. [2025-01-10 01:47:29,964 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:29,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:31,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:31,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129396808] [2025-01-10 01:47:31,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129396808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:31,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582975659] [2025-01-10 01:47:31,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:31,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:31,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:31,242 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:31,244 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:31,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 208 statements into 2 equivalence classes. [2025-01-10 01:47:31,320 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 208 of 208 statements. [2025-01-10 01:47:31,320 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:31,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:31,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-10 01:47:31,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:31,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:33,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582975659] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:33,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:33,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 95 [2025-01-10 01:47:33,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692885776] [2025-01-10 01:47:33,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:33,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:47:33,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:33,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:47:33,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2352, Invalid=6768, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:47:33,171 INFO L87 Difference]: Start difference. First operand 430 states and 491 transitions. Second operand has 96 states, 95 states have (on average 4.421052631578948) internal successors, (420), 96 states have internal predecessors, (420), 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:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:33,424 INFO L93 Difference]: Finished difference Result 516 states and 554 transitions. [2025-01-10 01:47:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-01-10 01:47:33,424 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.421052631578948) internal successors, (420), 96 states have internal predecessors, (420), 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 208 [2025-01-10 01:47:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:33,426 INFO L225 Difference]: With dead ends: 516 [2025-01-10 01:47:33,426 INFO L226 Difference]: Without dead ends: 515 [2025-01-10 01:47:33,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2711 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2352, Invalid=6768, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:47:33,428 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 239 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:33,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 423 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:47:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-10 01:47:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 432. [2025-01-10 01:47:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 428 states have (on average 1.0981308411214954) internal successors, (470), 431 states have internal predecessors, (470), 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:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 470 transitions. [2025-01-10 01:47:33,443 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 470 transitions. Word has length 208 [2025-01-10 01:47:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:33,443 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 470 transitions. [2025-01-10 01:47:33,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.421052631578948) internal successors, (420), 96 states have internal predecessors, (420), 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:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 470 transitions. [2025-01-10 01:47:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-10 01:47:33,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:33,445 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1] [2025-01-10 01:47:33,453 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:47:33,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 01:47:33,646 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:33,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash -111078548, now seen corresponding path program 4 times [2025-01-10 01:47:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:33,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539910099] [2025-01-10 01:47:33,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:33,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 209 statements into 2 equivalence classes. [2025-01-10 01:47:33,679 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 209 of 209 statements. [2025-01-10 01:47:33,679 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:33,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 0 proven. 2255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:34,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:34,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539910099] [2025-01-10 01:47:34,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539910099] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:34,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633134458] [2025-01-10 01:47:34,315 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:47:34,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:34,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:34,317 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:47:34,319 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:47:34,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 209 statements into 2 equivalence classes. [2025-01-10 01:47:34,403 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 209 of 209 statements. [2025-01-10 01:47:34,403 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:47:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:34,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:47:34,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 0 proven. 2255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:34,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 0 proven. 2255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:35,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633134458] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:35,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:35,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 49 [2025-01-10 01:47:35,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998785398] [2025-01-10 01:47:35,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:35,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-10 01:47:35,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:35,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-10 01:47:35,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 01:47:35,355 INFO L87 Difference]: Start difference. First operand 432 states and 470 transitions. Second operand has 50 states, 49 states have (on average 8.612244897959183) internal successors, (422), 50 states have internal predecessors, (422), 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:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:35,498 INFO L93 Difference]: Finished difference Result 509 states and 532 transitions. [2025-01-10 01:47:35,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-10 01:47:35,499 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 8.612244897959183) internal successors, (422), 50 states have internal predecessors, (422), 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 209 [2025-01-10 01:47:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:35,501 INFO L225 Difference]: With dead ends: 509 [2025-01-10 01:47:35,501 INFO L226 Difference]: Without dead ends: 508 [2025-01-10 01:47:35,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 01:47:35,502 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 182 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:35,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 430 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:47:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-10 01:47:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 433. [2025-01-10 01:47:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 429 states have (on average 1.0442890442890442) internal successors, (448), 432 states have internal predecessors, (448), 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:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 448 transitions. [2025-01-10 01:47:35,517 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 448 transitions. Word has length 209 [2025-01-10 01:47:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:35,518 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 448 transitions. [2025-01-10 01:47:35,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 8.612244897959183) internal successors, (422), 50 states have internal predecessors, (422), 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:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 448 transitions. [2025-01-10 01:47:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-01-10 01:47:35,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:35,520 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:47:35,529 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:47:35,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:47:35,721 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:35,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:35,722 INFO L85 PathProgramCache]: Analyzing trace with hash -741791142, now seen corresponding path program 5 times [2025-01-10 01:47:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:35,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-01-10 01:47:35,722 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:35,734 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 288 statements into 32 equivalence classes. [2025-01-10 01:47:35,809 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 288 of 288 statements. [2025-01-10 01:47:35,809 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-01-10 01:47:35,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4247 backedges. 0 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-01-10 01:47:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889480201] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831501061] [2025-01-10 01:47:37,922 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:37,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:37,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:37,924 INFO L229 MonitoredProcess]: Starting monitored process 19 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:37,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:47:37,963 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 288 statements into 32 equivalence classes. [2025-01-10 01:47:38,092 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 288 of 288 statements. [2025-01-10 01:47:38,092 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-01-10 01:47:38,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:38,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-01-10 01:47:38,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4247 backedges. 0 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:41,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4247 backedges. 0 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831501061] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:45,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:45,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 95, 95] total 254 [2025-01-10 01:47:45,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110211159] [2025-01-10 01:47:45,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:45,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 255 states [2025-01-10 01:47:45,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:45,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 255 interpolants. [2025-01-10 01:47:45,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8914, Invalid=55856, Unknown=0, NotChecked=0, Total=64770 [2025-01-10 01:47:45,502 INFO L87 Difference]: Start difference. First operand 433 states and 448 transitions. Second operand has 255 states, 254 states have (on average 3.3858267716535435) internal successors, (860), 255 states have internal predecessors, (860), 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:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:46,418 INFO L93 Difference]: Finished difference Result 727 states and 789 transitions. [2025-01-10 01:47:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-01-10 01:47:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 255 states, 254 states have (on average 3.3858267716535435) internal successors, (860), 255 states have internal predecessors, (860), 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 288 [2025-01-10 01:47:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:46,421 INFO L225 Difference]: With dead ends: 727 [2025-01-10 01:47:46,421 INFO L226 Difference]: Without dead ends: 598 [2025-01-10 01:47:46,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42687 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=8979, Invalid=56301, Unknown=0, NotChecked=0, Total=65280 [2025-01-10 01:47:46,424 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 411 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:46,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 489 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:47:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-10 01:47:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 580. [2025-01-10 01:47:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 576 states have (on average 1.0902777777777777) internal successors, (628), 579 states have internal predecessors, (628), 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:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2025-01-10 01:47:46,445 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 288 [2025-01-10 01:47:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:46,445 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2025-01-10 01:47:46,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 255 states, 254 states have (on average 3.3858267716535435) internal successors, (860), 255 states have internal predecessors, (860), 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:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2025-01-10 01:47:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-01-10 01:47:46,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:46,453 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1] [2025-01-10 01:47:46,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 01:47:46,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:46,654 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:46,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1436265292, now seen corresponding path program 5 times [2025-01-10 01:47:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:46,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-01-10 01:47:46,655 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:46,670 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 422 statements into 47 equivalence classes. [2025-01-10 01:47:46,828 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 422 of 422 statements. [2025-01-10 01:47:46,829 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:47:46,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 9545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:47:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-01-10 01:47:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666796419] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:47:50,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699099369] [2025-01-10 01:47:50,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:50,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:50,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:47:50,980 INFO L229 MonitoredProcess]: Starting monitored process 20 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:50,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:47:51,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 422 statements into 47 equivalence classes. [2025-01-10 01:47:51,305 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 422 of 422 statements. [2025-01-10 01:47:51,306 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:47:51,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:47:51,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 01:47:51,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:47:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 9545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:51,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:47:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 9545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:47:57,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699099369] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:47:57,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:47:57,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-01-10 01:47:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300140358] [2025-01-10 01:47:57,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:47:57,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-01-10 01:47:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:47:57,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-01-10 01:47:57,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-01-10 01:47:57,882 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand has 190 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 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:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:47:58,538 INFO L93 Difference]: Finished difference Result 1081 states and 1159 transitions. [2025-01-10 01:47:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-01-10 01:47:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 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 422 [2025-01-10 01:47:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:47:58,542 INFO L225 Difference]: With dead ends: 1081 [2025-01-10 01:47:58,542 INFO L226 Difference]: Without dead ends: 1080 [2025-01-10 01:47:58,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-01-10 01:47:58,545 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 616 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:47:58,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 818 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:47:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-01-10 01:47:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 862. [2025-01-10 01:47:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 858 states have (on average 1.1503496503496504) internal successors, (987), 861 states have internal predecessors, (987), 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:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 987 transitions. [2025-01-10 01:47:58,573 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 987 transitions. Word has length 422 [2025-01-10 01:47:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:47:58,573 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 987 transitions. [2025-01-10 01:47:58,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 4.455026455026455) internal successors, (842), 190 states have internal predecessors, (842), 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:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 987 transitions. [2025-01-10 01:47:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-01-10 01:47:58,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:47:58,579 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 46, 46, 1, 1, 1, 1] [2025-01-10 01:47:58,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 01:47:58,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:47:58,780 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:47:58,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:47:58,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445326, now seen corresponding path program 5 times [2025-01-10 01:47:58,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:47:58,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490095563] [2025-01-10 01:47:58,781 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:47:58,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:47:58,795 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 424 statements into 47 equivalence classes. [2025-01-10 01:47:58,930 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 424 of 424 statements. [2025-01-10 01:47:58,930 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:47:58,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:48:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9637 backedges. 0 proven. 9637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:02,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:48:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490095563] [2025-01-10 01:48:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490095563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:48:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717982211] [2025-01-10 01:48:02,653 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:48:02,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:48:02,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:48:02,655 INFO L229 MonitoredProcess]: Starting monitored process 21 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:02,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 01:48:02,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 424 statements into 47 equivalence classes. [2025-01-10 01:48:02,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 424 of 424 statements. [2025-01-10 01:48:02,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:48:02,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:48:02,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-01-10 01:48:02,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:48:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9637 backedges. 0 proven. 9637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:03,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:48:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9637 backedges. 0 proven. 9637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:09,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717982211] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:48:09,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:48:09,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-01-10 01:48:09,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362427900] [2025-01-10 01:48:09,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:48:09,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-01-10 01:48:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:48:09,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-01-10 01:48:09,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-01-10 01:48:09,344 INFO L87 Difference]: Start difference. First operand 862 states and 987 transitions. Second operand has 190 states, 189 states have (on average 4.476190476190476) internal successors, (846), 190 states have internal predecessors, (846), 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:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:48:10,051 INFO L93 Difference]: Finished difference Result 1036 states and 1114 transitions. [2025-01-10 01:48:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-01-10 01:48:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 4.476190476190476) internal successors, (846), 190 states have internal predecessors, (846), 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 424 [2025-01-10 01:48:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:48:10,055 INFO L225 Difference]: With dead ends: 1036 [2025-01-10 01:48:10,055 INFO L226 Difference]: Without dead ends: 1035 [2025-01-10 01:48:10,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 941 GetRequests, 753 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-01-10 01:48:10,057 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 514 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:48:10,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 816 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:48:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-01-10 01:48:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 864. [2025-01-10 01:48:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 860 states have (on average 1.0953488372093023) internal successors, (942), 863 states have internal predecessors, (942), 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:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 942 transitions. [2025-01-10 01:48:10,085 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 942 transitions. Word has length 424 [2025-01-10 01:48:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:48:10,085 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 942 transitions. [2025-01-10 01:48:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 4.476190476190476) internal successors, (846), 190 states have internal predecessors, (846), 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:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 942 transitions. [2025-01-10 01:48:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-10 01:48:10,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:48:10,088 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 46, 46, 1, 1, 1, 1] [2025-01-10 01:48:10,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-10 01:48:10,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:48:10,289 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:48:10,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:48:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1315164908, now seen corresponding path program 5 times [2025-01-10 01:48:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:48:10,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875116681] [2025-01-10 01:48:10,289 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:48:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:48:10,303 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 425 statements into 47 equivalence classes. [2025-01-10 01:48:10,414 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 425 of 425 statements. [2025-01-10 01:48:10,414 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:48:10,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:48:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9683 backedges. 0 proven. 9683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:48:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875116681] [2025-01-10 01:48:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875116681] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:48:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117382773] [2025-01-10 01:48:12,102 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:48:12,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:48:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:48:12,105 INFO L229 MonitoredProcess]: Starting monitored process 22 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:12,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 01:48:12,161 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 425 statements into 47 equivalence classes. [2025-01-10 01:48:12,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 425 of 425 statements. [2025-01-10 01:48:12,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:48:12,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:48:12,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:48:12,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:48:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9683 backedges. 0 proven. 9683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:12,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:48:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9683 backedges. 0 proven. 9683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:48:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117382773] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:48:15,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:48:15,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:48:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507816751] [2025-01-10 01:48:15,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:48:15,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:48:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:48:15,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:48:15,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:48:15,270 INFO L87 Difference]: Start difference. First operand 864 states and 942 transitions. Second operand has 96 states, 95 states have (on average 8.926315789473684) internal successors, (848), 96 states have internal predecessors, (848), 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:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:48:15,596 INFO L93 Difference]: Finished difference Result 1021 states and 1068 transitions. [2025-01-10 01:48:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:48:15,597 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 8.926315789473684) internal successors, (848), 96 states have internal predecessors, (848), 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 425 [2025-01-10 01:48:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:48:15,600 INFO L225 Difference]: With dead ends: 1021 [2025-01-10 01:48:15,600 INFO L226 Difference]: Without dead ends: 1020 [2025-01-10 01:48:15,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:48:15,602 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 397 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:48:15,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 863 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:48:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-01-10 01:48:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 865. [2025-01-10 01:48:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 861 states have (on average 1.0406504065040652) internal successors, (896), 864 states have internal predecessors, (896), 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:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 896 transitions. [2025-01-10 01:48:15,628 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 896 transitions. Word has length 425 [2025-01-10 01:48:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:48:15,629 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 896 transitions. [2025-01-10 01:48:15,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 8.926315789473684) internal successors, (848), 96 states have internal predecessors, (848), 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:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 896 transitions. [2025-01-10 01:48:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-10 01:48:15,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:48:15,632 INFO L218 NwaCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:48:15,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-01-10 01:48:15,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-01-10 01:48:15,836 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:48:15,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:48:15,837 INFO L85 PathProgramCache]: Analyzing trace with hash 293159002, now seen corresponding path program 6 times [2025-01-10 01:48:15,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:48:15,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723443215] [2025-01-10 01:48:15,837 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:48:15,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:48:15,852 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 576 statements into 64 equivalence classes. [2025-01-10 01:48:16,045 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 576 of 576 statements. [2025-01-10 01:48:16,045 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-01-10 01:48:16,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat