./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c -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 969ea7ac1a6cea553b276c54292ec8e81265daf8dd23428f445a60f39343440e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:54:46,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:54:47,038 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:54:47,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:54:47,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:54:47,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:54:47,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:54:47,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:54:47,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:54:47,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:54:47,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:54:47,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:54:47,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:54:47,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:54:47,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:54:47,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:54:47,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:54:47,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:54:47,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:54:47,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:54:47,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:54:47,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:54:47,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:54:47,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:54:47,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:54:47,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:54:47,072 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 -> 969ea7ac1a6cea553b276c54292ec8e81265daf8dd23428f445a60f39343440e [2025-01-10 01:54:47,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:54:47,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:54:47,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:54:47,302 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:54:47,303 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:54:47,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c [2025-01-10 01:54:48,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28413cb1d/5f24eed6956a4e55b1e40e33a49973b5/FLAGe104ac454 [2025-01-10 01:54:48,689 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:54:48,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c [2025-01-10 01:54:48,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28413cb1d/5f24eed6956a4e55b1e40e33a49973b5/FLAGe104ac454 [2025-01-10 01:54:48,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28413cb1d/5f24eed6956a4e55b1e40e33a49973b5 [2025-01-10 01:54:48,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:54:49,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:54:49,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:54:49,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:54:49,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:54:49,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:54:48" (1/1) ... [2025-01-10 01:54:49,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0c8b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49, skipping insertion in model container [2025-01-10 01:54:49,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:54:48" (1/1) ... [2025-01-10 01:54:49,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:54:49,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:54:49,140 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:54:49,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:54:49,165 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:54:49,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49 WrapperNode [2025-01-10 01:54:49,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:54:49,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:54:49,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:54:49,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:54:49,172 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:54:49" (1/1) ... [2025-01-10 01:54:49,177 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:54:49" (1/1) ... [2025-01-10 01:54:49,191 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2025-01-10 01:54:49,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:54:49,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:54:49,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:54:49,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:54:49,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,215 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:54:49,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:54:49,230 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:54:49,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:54:49,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:54:49,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (1/1) ... [2025-01-10 01:54:49,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:54:49,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:49,260 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:54:49,263 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:54:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:54:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:54:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:54:49,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:54:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:54:49,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:54:49,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:54:49,335 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:54:49,619 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-01-10 01:54:49,619 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:54:49,629 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:54:49,632 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:54:49,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:54:49 BoogieIcfgContainer [2025-01-10 01:54:49,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:54:49,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:54:49,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:54:49,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:54:49,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:54:48" (1/3) ... [2025-01-10 01:54:49,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2738bb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:54:49, skipping insertion in model container [2025-01-10 01:54:49,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:54:49" (2/3) ... [2025-01-10 01:54:49,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2738bb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:54:49, skipping insertion in model container [2025-01-10 01:54:49,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:54:49" (3/3) ... [2025-01-10 01:54:49,642 INFO L128 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound2.c [2025-01-10 01:54:49,657 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:54:49,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohendiv-ll_unwindbound2.c that has 2 procedures, 95 locations, 1 initial locations, 2 loop locations, and 34 error locations. [2025-01-10 01:54:49,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:54:49,710 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;@4475daf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:54:49,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-01-10 01:54:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 86 states have internal predecessors, (94), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:54:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:54:49,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:49,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:54:49,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:49,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash 889508744, now seen corresponding path program 1 times [2025-01-10 01:54:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:49,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889111537] [2025-01-10 01:54:49,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:49,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:49,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:54:49,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:54:49,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:49,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:49,810 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:54:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889111537] [2025-01-10 01:54:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889111537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:49,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:49,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:54:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775300170] [2025-01-10 01:54:49,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:49,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:54:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:49,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:54:49,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:54:49,830 INFO L87 Difference]: Start difference. First operand has 95 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 86 states have internal predecessors, (94), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:54:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:49,846 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2025-01-10 01:54:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:54:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:54:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:49,851 INFO L225 Difference]: With dead ends: 186 [2025-01-10 01:54:49,852 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 01:54:49,854 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:54:49,855 INFO L435 NwaCegarLoop]: 103 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, 103 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:54:49,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 01:54:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-10 01:54:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 80 states have internal predecessors, (84), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:54:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2025-01-10 01:54:49,891 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 6 [2025-01-10 01:54:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:49,892 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2025-01-10 01:54:49,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:54:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2025-01-10 01:54:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:54:49,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:49,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:54:49,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:54:49,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:49,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash 889568326, now seen corresponding path program 1 times [2025-01-10 01:54:49,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908065356] [2025-01-10 01:54:49,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:49,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:54:49,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:54:49,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:49,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:49,950 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:54:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:49,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908065356] [2025-01-10 01:54:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908065356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:49,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:49,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:54:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282762934] [2025-01-10 01:54:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:49,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:49,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:49,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:49,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:49,953 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:54:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:50,006 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2025-01-10 01:54:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:54:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:54:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:50,007 INFO L225 Difference]: With dead ends: 126 [2025-01-10 01:54:50,007 INFO L226 Difference]: Without dead ends: 125 [2025-01-10 01:54:50,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:54:50,008 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 39 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:50,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-10 01:54:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2025-01-10 01:54:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.75) internal successors, (105), 94 states have internal predecessors, (105), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:54:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2025-01-10 01:54:50,016 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 6 [2025-01-10 01:54:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:50,016 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2025-01-10 01:54:50,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:54:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2025-01-10 01:54:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:54:50,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:50,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:50,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:54:50,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:50,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1806814377, now seen corresponding path program 1 times [2025-01-10 01:54:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:50,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585283231] [2025-01-10 01:54:50,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:50,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:54:50,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:54:50,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:50,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:50,061 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:54:50,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:50,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585283231] [2025-01-10 01:54:50,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585283231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:50,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:50,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:54:50,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490190754] [2025-01-10 01:54:50,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:50,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:50,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:50,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:50,063 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:54:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:50,089 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2025-01-10 01:54:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:54:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:54:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:50,091 INFO L225 Difference]: With dead ends: 113 [2025-01-10 01:54:50,091 INFO L226 Difference]: Without dead ends: 104 [2025-01-10 01:54:50,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:54:50,092 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:50,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 267 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-10 01:54:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-10 01:54:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 94 states have internal predecessors, (103), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:54:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2025-01-10 01:54:50,098 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 7 [2025-01-10 01:54:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:50,098 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2025-01-10 01:54:50,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:54:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2025-01-10 01:54:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:54:50,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:50,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:50,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:54:50,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:50,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:50,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1181830318, now seen corresponding path program 1 times [2025-01-10 01:54:50,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:50,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802117740] [2025-01-10 01:54:50,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:50,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:50,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:54:50,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:54:50,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:50,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:50,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336035656] [2025-01-10 01:54:50,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:50,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:50,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:50,125 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:54:50,126 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:54:50,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:54:50,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:54:50,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:50,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:50,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:54:50,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:50,176 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:54:50,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:54:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802117740] [2025-01-10 01:54:50,181 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:54:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336035656] [2025-01-10 01:54:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336035656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:50,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:54:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105528347] [2025-01-10 01:54:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:50,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:54:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:50,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:54:50,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:54:50,182 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:54:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:50,224 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2025-01-10 01:54:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:54:50,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:54:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:50,225 INFO L225 Difference]: With dead ends: 119 [2025-01-10 01:54:50,226 INFO L226 Difference]: Without dead ends: 117 [2025-01-10 01:54:50,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:54:50,226 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 18 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:50,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-10 01:54:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2025-01-10 01:54:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 94 states have internal predecessors, (101), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:54:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2025-01-10 01:54:50,232 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 9 [2025-01-10 01:54:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:50,232 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2025-01-10 01:54:50,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:54:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2025-01-10 01:54:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:54:50,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:50,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:50,239 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:54:50,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:50,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:50,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash 702513269, now seen corresponding path program 1 times [2025-01-10 01:54:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129582463] [2025-01-10 01:54:50,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:50,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:54:50,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:54:50,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:50,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:50,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507076262] [2025-01-10 01:54:50,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:50,463 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:54:50,465 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:54:50,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:54:50,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:54:50,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:50,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:50,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:54:50,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:50,528 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:54:50,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:54:50,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129582463] [2025-01-10 01:54:50,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:54:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507076262] [2025-01-10 01:54:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507076262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:50,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:50,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:54:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556615923] [2025-01-10 01:54:50,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:50,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:54:50,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:50,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:54:50,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:54:50,530 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:54:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:50,630 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2025-01-10 01:54:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:54:50,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:54:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:50,631 INFO L225 Difference]: With dead ends: 160 [2025-01-10 01:54:50,631 INFO L226 Difference]: Without dead ends: 154 [2025-01-10 01:54:50,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:54:50,632 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 51 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:50,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 142 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-10 01:54:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2025-01-10 01:54:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 117 states have internal predecessors, (142), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:54:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2025-01-10 01:54:50,651 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 16 [2025-01-10 01:54:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:50,651 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2025-01-10 01:54:50,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:54:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2025-01-10 01:54:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:54:50,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:50,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:50,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:54:50,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:50,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:50,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash 805388023, now seen corresponding path program 1 times [2025-01-10 01:54:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:50,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727907038] [2025-01-10 01:54:50,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:50,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:54:50,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:54:50,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:50,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:50,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723909408] [2025-01-10 01:54:50,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:50,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:50,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:50,870 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:54:50,871 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:54:50,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:54:50,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:54:50,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:50,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:50,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:54:50,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:51,031 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:54:51,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:54:51,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727907038] [2025-01-10 01:54:51,034 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:54:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723909408] [2025-01-10 01:54:51,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723909408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:51,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:51,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:54:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495134070] [2025-01-10 01:54:51,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:51,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:51,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:51,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:51,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:51,035 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:54:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:51,127 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2025-01-10 01:54:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:54:51,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 01:54:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:51,128 INFO L225 Difference]: With dead ends: 153 [2025-01-10 01:54:51,128 INFO L226 Difference]: Without dead ends: 150 [2025-01-10 01:54:51,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:54:51,129 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 182 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:51,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 142 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-10 01:54:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2025-01-10 01:54:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.6588235294117648) internal successors, (141), 118 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:54:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2025-01-10 01:54:51,137 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 18 [2025-01-10 01:54:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:51,137 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2025-01-10 01:54:51,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:54:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2025-01-10 01:54:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:54:51,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:51,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:51,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:54:51,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:51,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:51,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -802774997, now seen corresponding path program 1 times [2025-01-10 01:54:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:51,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692447164] [2025-01-10 01:54:51,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:51,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:54:51,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:54:51,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:51,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:51,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716156214] [2025-01-10 01:54:51,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:51,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:51,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:51,351 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:54:51,353 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:54:51,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:54:51,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:54:51,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:51,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:51,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:54:51,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:51,421 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:54:51,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:54:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692447164] [2025-01-10 01:54:51,422 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:54:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716156214] [2025-01-10 01:54:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716156214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:51,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:51,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:54:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368872840] [2025-01-10 01:54:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:51,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:51,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:51,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:51,423 INFO L87 Difference]: Start difference. First operand 133 states and 165 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:54:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:51,527 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2025-01-10 01:54:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:54:51,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-10 01:54:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:51,528 INFO L225 Difference]: With dead ends: 153 [2025-01-10 01:54:51,528 INFO L226 Difference]: Without dead ends: 146 [2025-01-10 01:54:51,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:54:51,529 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 178 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:51,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 145 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-10 01:54:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2025-01-10 01:54:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.646341463414634) internal successors, (135), 115 states have internal predecessors, (135), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:54:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2025-01-10 01:54:51,536 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 19 [2025-01-10 01:54:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:51,536 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2025-01-10 01:54:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:54:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2025-01-10 01:54:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 01:54:51,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:51,537 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:51,544 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:54:51,738 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,SelfDestructingSolverStorable6 [2025-01-10 01:54:51,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:51,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:51,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1285675233, now seen corresponding path program 1 times [2025-01-10 01:54:51,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:51,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41621256] [2025-01-10 01:54:51,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:51,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:51,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:54:51,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:54:51,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:51,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:54:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:51,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41621256] [2025-01-10 01:54:51,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41621256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:51,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:51,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:54:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303124214] [2025-01-10 01:54:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:51,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:54:51,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:51,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:54:51,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:54:51,819 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:54:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:51,871 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2025-01-10 01:54:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:54:51,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-01-10 01:54:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:51,873 INFO L225 Difference]: With dead ends: 130 [2025-01-10 01:54:51,873 INFO L226 Difference]: Without dead ends: 128 [2025-01-10 01:54:51,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:54:51,874 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 149 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:51,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 247 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-10 01:54:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-01-10 01:54:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.6097560975609757) internal successors, (132), 113 states have internal predecessors, (132), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:54:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2025-01-10 01:54:51,881 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 27 [2025-01-10 01:54:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:51,881 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2025-01-10 01:54:51,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:54:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2025-01-10 01:54:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:54:51,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:51,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:51,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:54:51,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:51,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:51,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1201226479, now seen corresponding path program 1 times [2025-01-10 01:54:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:51,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211201651] [2025-01-10 01:54:51,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:51,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:54:51,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:54:51,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:51,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:54:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211201651] [2025-01-10 01:54:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211201651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:51,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:51,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:54:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732616157] [2025-01-10 01:54:51,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:51,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:54:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:51,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:54:51,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:54:51,940 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:54:51,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:51,984 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2025-01-10 01:54:51,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:54:51,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-01-10 01:54:51,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:51,985 INFO L225 Difference]: With dead ends: 214 [2025-01-10 01:54:51,985 INFO L226 Difference]: Without dead ends: 132 [2025-01-10 01:54:51,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:54:51,986 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 13 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:51,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 347 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-10 01:54:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-01-10 01:54:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 117 states have internal predecessors, (136), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 01:54:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2025-01-10 01:54:51,992 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 28 [2025-01-10 01:54:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:51,992 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2025-01-10 01:54:51,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:54:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2025-01-10 01:54:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:54:51,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:51,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:51,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:54:51,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 967558966, now seen corresponding path program 1 times [2025-01-10 01:54:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022340759] [2025-01-10 01:54:51,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:51,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:54:52,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:54:52,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:52,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451560578] [2025-01-10 01:54:52,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:52,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:52,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:52,016 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:54:52,018 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:54:52,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:54:52,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:54:52,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:52,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:52,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:54:52,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:54:52,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:54:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022340759] [2025-01-10 01:54:52,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:54:52,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451560578] [2025-01-10 01:54:52,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451560578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:52,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:52,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:54:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858057558] [2025-01-10 01:54:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:52,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:52,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:52,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:52,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:52,137 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:54:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:52,266 INFO L93 Difference]: Finished difference Result 206 states and 277 transitions. [2025-01-10 01:54:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:54:52,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-10 01:54:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:52,268 INFO L225 Difference]: With dead ends: 206 [2025-01-10 01:54:52,269 INFO L226 Difference]: Without dead ends: 201 [2025-01-10 01:54:52,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:52,270 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:52,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 96 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-10 01:54:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2025-01-10 01:54:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 160 states have internal predecessors, (205), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:54:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 245 transitions. [2025-01-10 01:54:52,284 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 245 transitions. Word has length 30 [2025-01-10 01:54:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:52,284 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 245 transitions. [2025-01-10 01:54:52,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:54:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 245 transitions. [2025-01-10 01:54:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 01:54:52,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:52,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:52,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:54:52,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:54:52,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:52,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -70443036, now seen corresponding path program 1 times [2025-01-10 01:54:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:52,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034819843] [2025-01-10 01:54:52,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:52,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:52,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:54:52,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:54:52,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:52,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:52,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057903644] [2025-01-10 01:54:52,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:52,515 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:54:52,515 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:54:52,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:54:52,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:54:52,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:52,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:52,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:54:52,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:54:52,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:54:52,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:52,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034819843] [2025-01-10 01:54:52,589 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:54:52,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057903644] [2025-01-10 01:54:52,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057903644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:52,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:52,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:54:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291268262] [2025-01-10 01:54:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:52,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:52,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:52,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:52,590 INFO L87 Difference]: Start difference. First operand 183 states and 245 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:54:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:52,688 INFO L93 Difference]: Finished difference Result 204 states and 268 transitions. [2025-01-10 01:54:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:54:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-10 01:54:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:52,689 INFO L225 Difference]: With dead ends: 204 [2025-01-10 01:54:52,689 INFO L226 Difference]: Without dead ends: 201 [2025-01-10 01:54:52,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:52,690 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 115 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:52,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 96 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-10 01:54:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 184. [2025-01-10 01:54:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.5538461538461539) internal successors, (202), 161 states have internal predecessors, (202), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:54:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 242 transitions. [2025-01-10 01:54:52,699 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 242 transitions. Word has length 31 [2025-01-10 01:54:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:52,699 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 242 transitions. [2025-01-10 01:54:52,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:54:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 242 transitions. [2025-01-10 01:54:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 01:54:52,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:52,700 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:52,705 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:54:52,903 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,SelfDestructingSolverStorable10 [2025-01-10 01:54:52,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:52,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1337096471, now seen corresponding path program 1 times [2025-01-10 01:54:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937878481] [2025-01-10 01:54:52,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:52,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:52,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 01:54:52,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:54:52,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:52,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937878481] [2025-01-10 01:54:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937878481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:52,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:54:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120512732] [2025-01-10 01:54:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:52,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:52,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:52,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:52,952 INFO L87 Difference]: Start difference. First operand 184 states and 242 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:53,077 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2025-01-10 01:54:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:54:53,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-01-10 01:54:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:53,078 INFO L225 Difference]: With dead ends: 219 [2025-01-10 01:54:53,078 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 01:54:53,078 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:54:53,079 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 133 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:53,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 01:54:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 186. [2025-01-10 01:54:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 163 states have internal predecessors, (202), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:54:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2025-01-10 01:54:53,087 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 51 [2025-01-10 01:54:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:53,087 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2025-01-10 01:54:53,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2025-01-10 01:54:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 01:54:53,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:53,088 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:53,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:54:53,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:53,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1499682464, now seen corresponding path program 1 times [2025-01-10 01:54:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:53,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590347026] [2025-01-10 01:54:53,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:53,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:53,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 01:54:53,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 01:54:53,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:53,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:53,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590347026] [2025-01-10 01:54:53,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590347026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:53,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:53,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:54:53,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308063307] [2025-01-10 01:54:53,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:53,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:53,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:53,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:53,134 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:53,260 INFO L93 Difference]: Finished difference Result 219 states and 267 transitions. [2025-01-10 01:54:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:54:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2025-01-10 01:54:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:53,261 INFO L225 Difference]: With dead ends: 219 [2025-01-10 01:54:53,261 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 01:54:53,261 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:54:53,262 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 130 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:53,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 92 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 01:54:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 188. [2025-01-10 01:54:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 134 states have (on average 1.507462686567164) internal successors, (202), 165 states have internal predecessors, (202), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:54:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2025-01-10 01:54:53,269 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 52 [2025-01-10 01:54:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:53,270 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2025-01-10 01:54:53,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2025-01-10 01:54:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 01:54:53,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:53,270 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:53,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:54:53,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:53,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1914160030, now seen corresponding path program 1 times [2025-01-10 01:54:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989180264] [2025-01-10 01:54:53,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:53,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:54:53,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:54:53,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:53,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:53,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:53,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989180264] [2025-01-10 01:54:53,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989180264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:54:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022687469] [2025-01-10 01:54:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:53,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:53,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:53,346 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:54:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:53,394 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2025-01-10 01:54:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:54:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2025-01-10 01:54:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:53,396 INFO L225 Difference]: With dead ends: 188 [2025-01-10 01:54:53,396 INFO L226 Difference]: Without dead ends: 187 [2025-01-10 01:54:53,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:53,396 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:53,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 72 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-10 01:54:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-01-10 01:54:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 134 states have (on average 1.4776119402985075) internal successors, (198), 164 states have internal predecessors, (198), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:54:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 238 transitions. [2025-01-10 01:54:53,404 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 238 transitions. Word has length 54 [2025-01-10 01:54:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:53,404 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 238 transitions. [2025-01-10 01:54:53,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:54:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 238 transitions. [2025-01-10 01:54:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 01:54:53,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:53,405 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:53,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:54:53,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:53,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1914160072, now seen corresponding path program 1 times [2025-01-10 01:54:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:53,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319030718] [2025-01-10 01:54:53,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:53,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:53,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:54:53,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:54:53,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:53,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:53,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:53,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319030718] [2025-01-10 01:54:53,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319030718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:53,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:53,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:54:53,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522476438] [2025-01-10 01:54:53,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:53,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:54:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:53,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:54:53,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:54:53,437 INFO L87 Difference]: Start difference. First operand 187 states and 238 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:53,472 INFO L93 Difference]: Finished difference Result 192 states and 238 transitions. [2025-01-10 01:54:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:54:53,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2025-01-10 01:54:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:53,474 INFO L225 Difference]: With dead ends: 192 [2025-01-10 01:54:53,474 INFO L226 Difference]: Without dead ends: 191 [2025-01-10 01:54:53,474 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:54:53,474 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:53,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 146 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-10 01:54:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2025-01-10 01:54:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 134 states have (on average 1.4701492537313432) internal successors, (197), 164 states have internal predecessors, (197), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 01:54:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2025-01-10 01:54:53,482 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 54 [2025-01-10 01:54:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:53,482 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2025-01-10 01:54:53,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2025-01-10 01:54:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 01:54:53,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:53,483 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:53,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:54:53,483 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:53,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash 790581328, now seen corresponding path program 1 times [2025-01-10 01:54:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919737812] [2025-01-10 01:54:53,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:53,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:54:53,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:54:53,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:53,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919737812] [2025-01-10 01:54:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919737812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:53,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:53,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:54:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234969033] [2025-01-10 01:54:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:54:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:53,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:54:53,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:54:53,535 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:53,888 INFO L93 Difference]: Finished difference Result 259 states and 327 transitions. [2025-01-10 01:54:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:54:53,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-01-10 01:54:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:53,893 INFO L225 Difference]: With dead ends: 259 [2025-01-10 01:54:53,893 INFO L226 Difference]: Without dead ends: 258 [2025-01-10 01:54:53,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:54:53,893 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 317 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:53,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 278 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:54:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-10 01:54:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2025-01-10 01:54:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 194 states have internal predecessors, (241), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-10 01:54:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2025-01-10 01:54:53,904 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 55 [2025-01-10 01:54:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:53,904 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2025-01-10 01:54:53,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2025-01-10 01:54:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 01:54:53,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:53,905 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:53,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:54:53,905 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:53,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash 790580046, now seen corresponding path program 1 times [2025-01-10 01:54:53,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:53,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194966276] [2025-01-10 01:54:53,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:53,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:53,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:54:53,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:54:53,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:53,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:53,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:53,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194966276] [2025-01-10 01:54:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194966276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:53,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:54:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646475624] [2025-01-10 01:54:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:53,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:54:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:53,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:54:53,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:54:53,963 INFO L87 Difference]: Start difference. First operand 222 states and 291 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:54:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:54,065 INFO L93 Difference]: Finished difference Result 368 states and 495 transitions. [2025-01-10 01:54:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:54:54,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2025-01-10 01:54:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:54,068 INFO L225 Difference]: With dead ends: 368 [2025-01-10 01:54:54,069 INFO L226 Difference]: Without dead ends: 367 [2025-01-10 01:54:54,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:54:54,069 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 192 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:54,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 217 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-10 01:54:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 334. [2025-01-10 01:54:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 261 states have (on average 1.5134099616858236) internal successors, (395), 291 states have internal predecessors, (395), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-10 01:54:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 475 transitions. [2025-01-10 01:54:54,092 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 475 transitions. Word has length 55 [2025-01-10 01:54:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:54,092 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 475 transitions. [2025-01-10 01:54:54,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:54:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 475 transitions. [2025-01-10 01:54:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:54:54,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:54,093 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:54,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:54:54,093 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1261822214, now seen corresponding path program 1 times [2025-01-10 01:54:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:54,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121687584] [2025-01-10 01:54:54,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:54,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 01:54:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:54:54,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:54,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:54,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:54,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121687584] [2025-01-10 01:54:54,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121687584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:54,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:54,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:54:54,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197997082] [2025-01-10 01:54:54,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:54,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:54:54,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:54,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:54:54,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:54,151 INFO L87 Difference]: Start difference. First operand 334 states and 475 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:54,272 INFO L93 Difference]: Finished difference Result 361 states and 496 transitions. [2025-01-10 01:54:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:54:54,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-01-10 01:54:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:54,274 INFO L225 Difference]: With dead ends: 361 [2025-01-10 01:54:54,274 INFO L226 Difference]: Without dead ends: 359 [2025-01-10 01:54:54,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:54:54,274 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 54 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:54,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 165 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:54:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-10 01:54:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 338. [2025-01-10 01:54:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 265 states have (on average 1.5056603773584907) internal successors, (399), 295 states have internal predecessors, (399), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-10 01:54:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 479 transitions. [2025-01-10 01:54:54,308 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 479 transitions. Word has length 56 [2025-01-10 01:54:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:54,309 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 479 transitions. [2025-01-10 01:54:54,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 479 transitions. [2025-01-10 01:54:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 01:54:54,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:54,309 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:54,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:54:54,310 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:54,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash -192056259, now seen corresponding path program 1 times [2025-01-10 01:54:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:54,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700263567] [2025-01-10 01:54:54,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:54,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 01:54:54,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:54:54,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:54,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:54,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700263567] [2025-01-10 01:54:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700263567] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:54:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545442163] [2025-01-10 01:54:54,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:54,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:54,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:54,407 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:54:54,409 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:54:54,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 01:54:54,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:54:54,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:54,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:54,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:54:54,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:54:54,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:54:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545442163] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:54:54,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:54:54,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 16 [2025-01-10 01:54:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955624647] [2025-01-10 01:54:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:54,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:54:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:54,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:54:54,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:54:54,700 INFO L87 Difference]: Start difference. First operand 338 states and 479 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:54,802 INFO L93 Difference]: Finished difference Result 373 states and 504 transitions. [2025-01-10 01:54:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:54:54,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-01-10 01:54:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:54,804 INFO L225 Difference]: With dead ends: 373 [2025-01-10 01:54:54,804 INFO L226 Difference]: Without dead ends: 371 [2025-01-10 01:54:54,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:54:54,805 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 86 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:54,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 394 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:54:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-10 01:54:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 346. [2025-01-10 01:54:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.4649446494464944) internal successors, (397), 301 states have internal predecessors, (397), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-10 01:54:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 477 transitions. [2025-01-10 01:54:54,821 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 477 transitions. Word has length 60 [2025-01-10 01:54:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:54,821 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 477 transitions. [2025-01-10 01:54:54,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 477 transitions. [2025-01-10 01:54:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 01:54:54,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:54,822 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:54,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:54:55,026 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:54:55,027 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:55,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 117530584, now seen corresponding path program 1 times [2025-01-10 01:54:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388015557] [2025-01-10 01:54:55,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:55,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:55,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 01:54:55,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 01:54:55,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:55,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:55,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851651087] [2025-01-10 01:54:55,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:55,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:55,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:55,045 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:54:55,047 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:54:55,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 01:54:55,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 01:54:55,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:55,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:55,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:54:55,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:55,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:54:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388015557] [2025-01-10 01:54:55,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:54:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851651087] [2025-01-10 01:54:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851651087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:55,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:55,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:54:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053308032] [2025-01-10 01:54:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:54:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:55,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:54:55,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:54:55,375 INFO L87 Difference]: Start difference. First operand 346 states and 477 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:55,693 INFO L93 Difference]: Finished difference Result 539 states and 751 transitions. [2025-01-10 01:54:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:54:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-01-10 01:54:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:55,695 INFO L225 Difference]: With dead ends: 539 [2025-01-10 01:54:55,695 INFO L226 Difference]: Without dead ends: 530 [2025-01-10 01:54:55,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:54:55,696 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 252 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:55,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 208 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:54:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-10 01:54:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 501. [2025-01-10 01:54:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 406 states have (on average 1.4334975369458127) internal successors, (582), 436 states have internal predecessors, (582), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-10 01:54:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 702 transitions. [2025-01-10 01:54:55,722 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 702 transitions. Word has length 62 [2025-01-10 01:54:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:55,722 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 702 transitions. [2025-01-10 01:54:55,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 702 transitions. [2025-01-10 01:54:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 01:54:55,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:55,723 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:55,733 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:54:55,925 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:54:55,926 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:55,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:55,926 INFO L85 PathProgramCache]: Analyzing trace with hash -651519047, now seen corresponding path program 1 times [2025-01-10 01:54:55,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:55,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069493907] [2025-01-10 01:54:55,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:55,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:55,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 01:54:55,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 01:54:55,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:55,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543402176] [2025-01-10 01:54:55,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:55,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:55,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:55,964 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:54:55,965 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:54:55,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 01:54:56,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 01:54:56,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:56,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:54:56,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:56,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:54:56,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069493907] [2025-01-10 01:54:56,525 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:54:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543402176] [2025-01-10 01:54:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543402176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:54:56,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:54:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-01-10 01:54:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912172933] [2025-01-10 01:54:56,525 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:54:56,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:54:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:56,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:54:56,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:54:56,526 INFO L87 Difference]: Start difference. First operand 501 states and 702 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:56,826 INFO L93 Difference]: Finished difference Result 612 states and 843 transitions. [2025-01-10 01:54:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:54:56,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-01-10 01:54:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:56,829 INFO L225 Difference]: With dead ends: 612 [2025-01-10 01:54:56,829 INFO L226 Difference]: Without dead ends: 609 [2025-01-10 01:54:56,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:54:56,829 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 149 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:56,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 222 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:54:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-10 01:54:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 566. [2025-01-10 01:54:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 461 states have (on average 1.4251626898047722) internal successors, (657), 491 states have internal predecessors, (657), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-10 01:54:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 797 transitions. [2025-01-10 01:54:56,893 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 797 transitions. Word has length 63 [2025-01-10 01:54:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:56,894 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 797 transitions. [2025-01-10 01:54:56,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 797 transitions. [2025-01-10 01:54:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 01:54:56,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:56,894 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:56,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:54:57,095 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:54:57,095 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:57,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:57,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1277746170, now seen corresponding path program 1 times [2025-01-10 01:54:57,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:57,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272318686] [2025-01-10 01:54:57,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:57,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:57,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 01:54:57,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 01:54:57,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:57,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:54:57,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272318686] [2025-01-10 01:54:57,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272318686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:54:57,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:54:57,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:54:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422184094] [2025-01-10 01:54:57,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:54:57,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:54:57,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:54:57,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:54:57,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:54:57,219 INFO L87 Difference]: Start difference. First operand 566 states and 797 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:54:57,585 INFO L93 Difference]: Finished difference Result 841 states and 1202 transitions. [2025-01-10 01:54:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:54:57,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 01:54:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:54:57,589 INFO L225 Difference]: With dead ends: 841 [2025-01-10 01:54:57,589 INFO L226 Difference]: Without dead ends: 838 [2025-01-10 01:54:57,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:54:57,590 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 150 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:54:57,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 241 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:54:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-01-10 01:54:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 585. [2025-01-10 01:54:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 477 states have (on average 1.4067085953878407) internal successors, (671), 506 states have internal predecessors, (671), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-10 01:54:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 819 transitions. [2025-01-10 01:54:57,645 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 819 transitions. Word has length 64 [2025-01-10 01:54:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:54:57,645 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 819 transitions. [2025-01-10 01:54:57,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:54:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 819 transitions. [2025-01-10 01:54:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 01:54:57,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:54:57,646 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:54:57,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:54:57,646 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:54:57,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:54:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash 955425755, now seen corresponding path program 1 times [2025-01-10 01:54:57,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:54:57,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109302197] [2025-01-10 01:54:57,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:54:57,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:54:57,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:54:57,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:57,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:54:57,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926860446] [2025-01-10 01:54:57,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:54:57,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:54:57,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:54:57,664 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:54:57,673 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:54:57,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:54:57,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:54:57,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:54:57,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:54:57,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:54:57,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:54:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:54:57,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:06,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109302197] [2025-01-10 01:55:06,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:55:06,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926860446] [2025-01-10 01:55:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926860446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:06,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:55:06,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-01-10 01:55:06,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126443669] [2025-01-10 01:55:06,089 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:06,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:55:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:06,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:55:06,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=81, Unknown=2, NotChecked=0, Total=110 [2025-01-10 01:55:06,090 INFO L87 Difference]: Start difference. First operand 585 states and 819 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:55:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:06,445 INFO L93 Difference]: Finished difference Result 619 states and 840 transitions. [2025-01-10 01:55:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:55:06,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 01:55:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:06,448 INFO L225 Difference]: With dead ends: 619 [2025-01-10 01:55:06,448 INFO L226 Difference]: Without dead ends: 612 [2025-01-10 01:55:06,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=52, Invalid=156, Unknown=2, NotChecked=0, Total=210 [2025-01-10 01:55:06,449 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 286 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:06,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 253 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:55:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-10 01:55:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 583. [2025-01-10 01:55:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 475 states have (on average 1.3978947368421053) internal successors, (664), 504 states have internal predecessors, (664), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-10 01:55:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 812 transitions. [2025-01-10 01:55:06,499 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 812 transitions. Word has length 65 [2025-01-10 01:55:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:06,500 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 812 transitions. [2025-01-10 01:55:06,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:55:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 812 transitions. [2025-01-10 01:55:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 01:55:06,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:06,500 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:06,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:55:06,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 01:55:06,701 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:06,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash -341538506, now seen corresponding path program 1 times [2025-01-10 01:55:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:06,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137348999] [2025-01-10 01:55:06,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:06,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:06,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 01:55:06,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 01:55:06,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:06,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:06,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:06,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137348999] [2025-01-10 01:55:06,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137348999] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:06,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070938051] [2025-01-10 01:55:06,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:06,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:06,828 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:55:06,829 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:55:06,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 01:55:06,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 01:55:06,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:06,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:06,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:55:06,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 01:55:06,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:07,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070938051] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:55:07,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:55:07,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-01-10 01:55:07,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571465340] [2025-01-10 01:55:07,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:07,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:55:07,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:07,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:55:07,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:55:07,020 INFO L87 Difference]: Start difference. First operand 583 states and 812 transitions. Second operand has 16 states, 15 states have (on average 7.866666666666666) internal successors, (118), 16 states have internal predecessors, (118), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-10 01:55:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:07,307 INFO L93 Difference]: Finished difference Result 1075 states and 1514 transitions. [2025-01-10 01:55:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:55:07,307 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.866666666666666) internal successors, (118), 16 states have internal predecessors, (118), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 69 [2025-01-10 01:55:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:07,311 INFO L225 Difference]: With dead ends: 1075 [2025-01-10 01:55:07,311 INFO L226 Difference]: Without dead ends: 1074 [2025-01-10 01:55:07,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-01-10 01:55:07,312 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 174 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:07,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 792 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:55:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-01-10 01:55:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 942. [2025-01-10 01:55:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 778 states have (on average 1.4460154241645244) internal successors, (1125), 807 states have internal predecessors, (1125), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-10 01:55:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1377 transitions. [2025-01-10 01:55:07,359 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1377 transitions. Word has length 69 [2025-01-10 01:55:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:07,360 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1377 transitions. [2025-01-10 01:55:07,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.866666666666666) internal successors, (118), 16 states have internal predecessors, (118), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-10 01:55:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1377 transitions. [2025-01-10 01:55:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 01:55:07,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:07,361 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:07,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:55:07,565 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,SelfDestructingSolverStorable23 [2025-01-10 01:55:07,565 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:07,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1800987109, now seen corresponding path program 1 times [2025-01-10 01:55:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653742732] [2025-01-10 01:55:07,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:07,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 01:55:07,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 01:55:07,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:07,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653742732] [2025-01-10 01:55:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653742732] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344237957] [2025-01-10 01:55:07,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:07,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:07,640 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:55:07,641 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:55:07,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 01:55:07,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 01:55:07,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:07,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:07,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:55:07,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 01:55:07,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:07,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344237957] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:55:07,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:55:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-01-10 01:55:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297323676] [2025-01-10 01:55:07,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:55:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:07,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:55:07,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:55:07,848 INFO L87 Difference]: Start difference. First operand 942 states and 1377 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 01:55:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:07,967 INFO L93 Difference]: Finished difference Result 1108 states and 1588 transitions. [2025-01-10 01:55:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:55:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 71 [2025-01-10 01:55:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:07,968 INFO L225 Difference]: With dead ends: 1108 [2025-01-10 01:55:07,968 INFO L226 Difference]: Without dead ends: 337 [2025-01-10 01:55:07,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:55:07,970 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 74 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:07,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 319 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:55:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-10 01:55:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 298. [2025-01-10 01:55:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 242 states have (on average 1.2851239669421488) internal successors, (311), 261 states have internal predecessors, (311), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-10 01:55:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 377 transitions. [2025-01-10 01:55:07,991 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 377 transitions. Word has length 71 [2025-01-10 01:55:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:07,991 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 377 transitions. [2025-01-10 01:55:07,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 01:55:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 377 transitions. [2025-01-10 01:55:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 01:55:07,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:07,992 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:08,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:55:08,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:08,193 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:08,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1800987003, now seen corresponding path program 1 times [2025-01-10 01:55:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467868268] [2025-01-10 01:55:08,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:08,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 01:55:08,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 01:55:08,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:08,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:08,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467868268] [2025-01-10 01:55:08,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467868268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:55:08,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:55:08,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:55:08,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070732611] [2025-01-10 01:55:08,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:55:08,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:55:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:08,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:55:08,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:55:08,242 INFO L87 Difference]: Start difference. First operand 298 states and 377 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:55:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:08,304 INFO L93 Difference]: Finished difference Result 298 states and 377 transitions. [2025-01-10 01:55:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:55:08,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2025-01-10 01:55:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:08,306 INFO L225 Difference]: With dead ends: 298 [2025-01-10 01:55:08,306 INFO L226 Difference]: Without dead ends: 297 [2025-01-10 01:55:08,306 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:55:08,307 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 149 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:55:08,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:55:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-10 01:55:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-01-10 01:55:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 242 states have (on average 1.2768595041322315) internal successors, (309), 260 states have internal predecessors, (309), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-10 01:55:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 375 transitions. [2025-01-10 01:55:08,321 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 375 transitions. Word has length 71 [2025-01-10 01:55:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:08,321 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 375 transitions. [2025-01-10 01:55:08,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:55:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 375 transitions. [2025-01-10 01:55:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 01:55:08,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:08,322 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:08,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:55:08,322 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:08,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 3977889, now seen corresponding path program 1 times [2025-01-10 01:55:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777472481] [2025-01-10 01:55:08,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:08,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 01:55:08,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:55:08,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:08,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777472481] [2025-01-10 01:55:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777472481] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565589519] [2025-01-10 01:55:08,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:08,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:08,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:08,388 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:55:08,393 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:55:08,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 01:55:08,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:55:08,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:08,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:08,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:55:08,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:08,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:08,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565589519] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:55:08,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:55:08,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 01:55:08,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360592029] [2025-01-10 01:55:08,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:08,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:55:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:08,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:55:08,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:55:08,730 INFO L87 Difference]: Start difference. First operand 297 states and 375 transitions. Second operand has 15 states, 14 states have (on average 8.142857142857142) internal successors, (114), 15 states have internal predecessors, (114), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-10 01:55:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:09,333 INFO L93 Difference]: Finished difference Result 483 states and 609 transitions. [2025-01-10 01:55:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:55:09,333 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.142857142857142) internal successors, (114), 15 states have internal predecessors, (114), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 72 [2025-01-10 01:55:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:09,335 INFO L225 Difference]: With dead ends: 483 [2025-01-10 01:55:09,335 INFO L226 Difference]: Without dead ends: 482 [2025-01-10 01:55:09,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2025-01-10 01:55:09,336 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 454 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:09,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 513 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:55:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-01-10 01:55:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 382. [2025-01-10 01:55:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 319 states have (on average 1.2789968652037618) internal successors, (408), 336 states have internal predecessors, (408), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-10 01:55:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 490 transitions. [2025-01-10 01:55:09,356 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 490 transitions. Word has length 72 [2025-01-10 01:55:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:09,356 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 490 transitions. [2025-01-10 01:55:09,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.142857142857142) internal successors, (114), 15 states have internal predecessors, (114), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-10 01:55:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 490 transitions. [2025-01-10 01:55:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 01:55:09,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:09,358 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:09,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:55:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:09,559 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash 123314695, now seen corresponding path program 1 times [2025-01-10 01:55:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234159136] [2025-01-10 01:55:09,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:09,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 01:55:09,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 01:55:09,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:09,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:09,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:09,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234159136] [2025-01-10 01:55:09,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234159136] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:09,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031041315] [2025-01-10 01:55:09,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:09,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:09,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:09,634 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:55:09,636 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:55:09,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 01:55:09,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 01:55:09,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:09,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:09,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:55:09,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:09,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:55:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031041315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:55:09,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:55:09,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:55:09,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379628852] [2025-01-10 01:55:09,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:55:09,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:55:09,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:09,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:55:09,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:55:09,762 INFO L87 Difference]: Start difference. First operand 382 states and 490 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:55:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:09,886 INFO L93 Difference]: Finished difference Result 397 states and 515 transitions. [2025-01-10 01:55:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:55:09,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-01-10 01:55:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:09,889 INFO L225 Difference]: With dead ends: 397 [2025-01-10 01:55:09,889 INFO L226 Difference]: Without dead ends: 396 [2025-01-10 01:55:09,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:55:09,889 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:09,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 144 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:55:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-10 01:55:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 381. [2025-01-10 01:55:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 319 states have (on average 1.2664576802507836) internal successors, (404), 335 states have internal predecessors, (404), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-10 01:55:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 486 transitions. [2025-01-10 01:55:09,908 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 486 transitions. Word has length 73 [2025-01-10 01:55:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:09,908 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 486 transitions. [2025-01-10 01:55:09,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:55:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 486 transitions. [2025-01-10 01:55:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 01:55:09,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:09,909 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:09,917 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:55:10,109 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,SelfDestructingSolverStorable27 [2025-01-10 01:55:10,111 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:10,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash -472211613, now seen corresponding path program 1 times [2025-01-10 01:55:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213983702] [2025-01-10 01:55:10,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:10,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:55:10,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:55:10,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:10,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:10,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:10,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213983702] [2025-01-10 01:55:10,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213983702] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:10,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889859484] [2025-01-10 01:55:10,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:10,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:10,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:10,168 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:55:10,173 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:55:10,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:55:10,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:55:10,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:10,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:10,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:55:10,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:10,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:10,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889859484] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:55:10,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:55:10,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:55:10,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392496008] [2025-01-10 01:55:10,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:10,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:55:10,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:10,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:55:10,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:55:10,380 INFO L87 Difference]: Start difference. First operand 381 states and 486 transitions. Second operand has 11 states, 10 states have (on average 12.9) internal successors, (129), 11 states have internal predecessors, (129), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-01-10 01:55:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:10,597 INFO L93 Difference]: Finished difference Result 525 states and 682 transitions. [2025-01-10 01:55:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:55:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.9) internal successors, (129), 11 states have internal predecessors, (129), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 74 [2025-01-10 01:55:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:10,599 INFO L225 Difference]: With dead ends: 525 [2025-01-10 01:55:10,599 INFO L226 Difference]: Without dead ends: 524 [2025-01-10 01:55:10,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:55:10,600 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 140 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:10,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 239 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:55:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-10 01:55:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 455. [2025-01-10 01:55:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 385 states have (on average 1.2467532467532467) internal successors, (480), 401 states have internal predecessors, (480), 49 states have call successors, (49), 4 states have call predecessors, (49), 4 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-10 01:55:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 578 transitions. [2025-01-10 01:55:10,623 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 578 transitions. Word has length 74 [2025-01-10 01:55:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:10,623 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 578 transitions. [2025-01-10 01:55:10,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.9) internal successors, (129), 11 states have internal predecessors, (129), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-01-10 01:55:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 578 transitions. [2025-01-10 01:55:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 01:55:10,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:10,624 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:10,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 01:55:10,824 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,SelfDestructingSolverStorable28 [2025-01-10 01:55:10,824 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:10,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1638225718, now seen corresponding path program 1 times [2025-01-10 01:55:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835212935] [2025-01-10 01:55:10,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:10,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 01:55:10,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 01:55:10,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:10,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:10,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835212935] [2025-01-10 01:55:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835212935] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878285615] [2025-01-10 01:55:10,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:10,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:10,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:10,913 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:55:10,918 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:55:10,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 01:55:10,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 01:55:10,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:10,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:10,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:55:10,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 01:55:11,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878285615] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:55:11,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:55:11,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-01-10 01:55:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591373992] [2025-01-10 01:55:11,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:11,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:55:11,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:11,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:55:11,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:55:11,157 INFO L87 Difference]: Start difference. First operand 455 states and 578 transitions. Second operand has 21 states, 20 states have (on average 7.05) internal successors, (141), 21 states have internal predecessors, (141), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-10 01:55:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:11,378 INFO L93 Difference]: Finished difference Result 473 states and 592 transitions. [2025-01-10 01:55:11,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:55:11,378 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 7.05) internal successors, (141), 21 states have internal predecessors, (141), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 77 [2025-01-10 01:55:11,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:11,380 INFO L225 Difference]: With dead ends: 473 [2025-01-10 01:55:11,380 INFO L226 Difference]: Without dead ends: 472 [2025-01-10 01:55:11,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 01:55:11,381 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 124 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:11,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 647 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:55:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-10 01:55:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 454. [2025-01-10 01:55:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 385 states have (on average 1.238961038961039) internal successors, (477), 400 states have internal predecessors, (477), 49 states have call successors, (49), 4 states have call predecessors, (49), 4 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-10 01:55:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 575 transitions. [2025-01-10 01:55:11,403 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 575 transitions. Word has length 77 [2025-01-10 01:55:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:11,403 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 575 transitions. [2025-01-10 01:55:11,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 7.05) internal successors, (141), 21 states have internal predecessors, (141), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-10 01:55:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 575 transitions. [2025-01-10 01:55:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 01:55:11,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:11,404 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:11,413 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:55:11,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:11,605 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1918084239, now seen corresponding path program 1 times [2025-01-10 01:55:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333335179] [2025-01-10 01:55:11,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:11,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 01:55:11,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 01:55:11,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-10 01:55:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333335179] [2025-01-10 01:55:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333335179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:55:11,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:55:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:55:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308842469] [2025-01-10 01:55:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:55:11,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:55:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:11,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:55:11,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:55:11,643 INFO L87 Difference]: Start difference. First operand 454 states and 575 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 01:55:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:11,676 INFO L93 Difference]: Finished difference Result 502 states and 617 transitions. [2025-01-10 01:55:11,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:55:11,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 79 [2025-01-10 01:55:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:11,678 INFO L225 Difference]: With dead ends: 502 [2025-01-10 01:55:11,678 INFO L226 Difference]: Without dead ends: 216 [2025-01-10 01:55:11,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:55:11,678 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 12 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:11,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 273 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:55:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-10 01:55:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2025-01-10 01:55:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.125) internal successors, (198), 186 states have internal predecessors, (198), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 01:55:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 234 transitions. [2025-01-10 01:55:11,690 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 234 transitions. Word has length 79 [2025-01-10 01:55:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:11,690 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 234 transitions. [2025-01-10 01:55:11,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 01:55:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 234 transitions. [2025-01-10 01:55:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 01:55:11,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:11,691 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 01:55:11,692 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:11,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1918084389, now seen corresponding path program 1 times [2025-01-10 01:55:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376409161] [2025-01-10 01:55:11,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:11,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 01:55:11,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 01:55:11,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:11,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:55:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453347716] [2025-01-10 01:55:11,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:11,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:11,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:11,710 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:55:11,714 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:55:11,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 01:55:11,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 01:55:11,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:11,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:11,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:55:11,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:11,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:55:11,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376409161] [2025-01-10 01:55:11,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:55:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453347716] [2025-01-10 01:55:11,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453347716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:55:11,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:55:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:55:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242242465] [2025-01-10 01:55:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:55:11,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:55:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:11,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:55:11,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:55:11,989 INFO L87 Difference]: Start difference. First operand 209 states and 234 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:55:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:12,129 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2025-01-10 01:55:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:55:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 79 [2025-01-10 01:55:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:12,130 INFO L225 Difference]: With dead ends: 210 [2025-01-10 01:55:12,130 INFO L226 Difference]: Without dead ends: 209 [2025-01-10 01:55:12,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:55:12,131 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 53 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:12,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 173 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:55:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-10 01:55:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2025-01-10 01:55:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 159 states have (on average 1.1320754716981132) internal successors, (180), 169 states have internal predecessors, (180), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 01:55:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2025-01-10 01:55:12,149 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 79 [2025-01-10 01:55:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:12,149 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2025-01-10 01:55:12,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:55:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2025-01-10 01:55:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-10 01:55:12,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:12,150 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:12,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-10 01:55:12,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:12,354 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:12,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -668925940, now seen corresponding path program 1 times [2025-01-10 01:55:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:12,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966336400] [2025-01-10 01:55:12,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:12,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 01:55:12,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 01:55:12,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:12,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:55:12,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348707321] [2025-01-10 01:55:12,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:12,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:12,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:12,375 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:55:12,376 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:55:12,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 01:55:12,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 01:55:12,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:12,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:12,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:55:12,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:12,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:13,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:13,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966336400] [2025-01-10 01:55:13,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:55:13,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348707321] [2025-01-10 01:55:13,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348707321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:13,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:55:13,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-01-10 01:55:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605672278] [2025-01-10 01:55:13,055 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:13,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:55:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:13,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:55:13,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:55:13,056 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:55:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:13,178 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2025-01-10 01:55:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:55:13,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 80 [2025-01-10 01:55:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:13,179 INFO L225 Difference]: With dead ends: 212 [2025-01-10 01:55:13,179 INFO L226 Difference]: Without dead ends: 211 [2025-01-10 01:55:13,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:55:13,179 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 72 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:13,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 178 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:55:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-10 01:55:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2025-01-10 01:55:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 177 states have (on average 1.11864406779661) internal successors, (198), 186 states have internal predecessors, (198), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 01:55:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 234 transitions. [2025-01-10 01:55:13,190 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 234 transitions. Word has length 80 [2025-01-10 01:55:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:13,190 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 234 transitions. [2025-01-10 01:55:13,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:55:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 234 transitions. [2025-01-10 01:55:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 01:55:13,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:13,193 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:13,199 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:55:13,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:13,394 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:13,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash 738132487, now seen corresponding path program 1 times [2025-01-10 01:55:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556960194] [2025-01-10 01:55:13,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:13,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 01:55:13,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 01:55:13,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:13,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:13,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556960194] [2025-01-10 01:55:13,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556960194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:55:13,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:55:13,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:55:13,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859270088] [2025-01-10 01:55:13,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:55:13,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:55:13,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:13,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:55:13,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:55:13,463 INFO L87 Difference]: Start difference. First operand 209 states and 234 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:55:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:13,645 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2025-01-10 01:55:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:55:13,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 81 [2025-01-10 01:55:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:13,647 INFO L225 Difference]: With dead ends: 210 [2025-01-10 01:55:13,647 INFO L226 Difference]: Without dead ends: 209 [2025-01-10 01:55:13,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:55:13,647 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 91 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:13,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 212 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:55:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-10 01:55:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 197. [2025-01-10 01:55:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.108433734939759) internal successors, (184), 174 states have internal predecessors, (184), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 01:55:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2025-01-10 01:55:13,657 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 81 [2025-01-10 01:55:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:13,658 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2025-01-10 01:55:13,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:55:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2025-01-10 01:55:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 01:55:13,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:13,659 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:13,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 01:55:13,659 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:13,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1407270766, now seen corresponding path program 1 times [2025-01-10 01:55:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:13,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467586023] [2025-01-10 01:55:13,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:13,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 01:55:13,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:55:13,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:13,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:55:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295209896] [2025-01-10 01:55:13,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:13,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:13,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:13,675 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:55:13,676 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:55:13,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 01:55:13,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:55:13,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:13,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:13,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:55:13,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 01:55:13,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467586023] [2025-01-10 01:55:18,190 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:55:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295209896] [2025-01-10 01:55:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295209896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:18,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:55:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-01-10 01:55:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533897261] [2025-01-10 01:55:18,190 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:55:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:18,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:55:18,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=164, Unknown=1, NotChecked=0, Total=210 [2025-01-10 01:55:18,191 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:55:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:18,532 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2025-01-10 01:55:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:55:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2025-01-10 01:55:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:18,536 INFO L225 Difference]: With dead ends: 200 [2025-01-10 01:55:18,536 INFO L226 Difference]: Without dead ends: 174 [2025-01-10 01:55:18,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=90, Invalid=329, Unknown=1, NotChecked=0, Total=420 [2025-01-10 01:55:18,536 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 100 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:18,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 218 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:55:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-10 01:55:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-01-10 01:55:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 144 states have (on average 1.1180555555555556) internal successors, (161), 152 states have internal predecessors, (161), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 01:55:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2025-01-10 01:55:18,572 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 82 [2025-01-10 01:55:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:18,576 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2025-01-10 01:55:18,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:55:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2025-01-10 01:55:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 01:55:18,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:55:18,576 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:18,582 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:55:18,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:18,777 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-01-10 01:55:18,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:55:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1372608634, now seen corresponding path program 1 times [2025-01-10 01:55:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:55:18,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411752590] [2025-01-10 01:55:18,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:18,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:55:18,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 01:55:18,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 01:55:18,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:18,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:55:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:55:18,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411752590] [2025-01-10 01:55:18,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411752590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:55:18,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746051353] [2025-01-10 01:55:18,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:55:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:18,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:55:18,875 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:55:18,875 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:55:18,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 01:55:18,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 01:55:18,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:55:18,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:55:18,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:55:18,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:55:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 01:55:18,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:55:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-10 01:55:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746051353] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:55:19,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:55:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-01-10 01:55:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221388962] [2025-01-10 01:55:19,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:55:19,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:55:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:55:19,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:55:19,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:55:19,044 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-10 01:55:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:55:19,091 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2025-01-10 01:55:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:55:19,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 84 [2025-01-10 01:55:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:55:19,092 INFO L225 Difference]: With dead ends: 174 [2025-01-10 01:55:19,092 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:55:19,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 163 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:55:19,093 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:55:19,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 170 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:55:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:55:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:55:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:55:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:55:19,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2025-01-10 01:55:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:55:19,094 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:55:19,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-10 01:55:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:55:19,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:55:19,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 34 remaining) [2025-01-10 01:55:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 34 remaining) [2025-01-10 01:55:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 34 remaining) [2025-01-10 01:55:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 34 remaining) [2025-01-10 01:55:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 34 remaining) [2025-01-10 01:55:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 34 remaining) [2025-01-10 01:55:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 34 remaining) [2025-01-10 01:55:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 34 remaining) [2025-01-10 01:55:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 34 remaining) [2025-01-10 01:55:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 34 remaining) [2025-01-10 01:55:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 34 remaining) [2025-01-10 01:55:19,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 34 remaining) [2025-01-10 01:55:19,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 34 remaining) [2025-01-10 01:55:19,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 34 remaining) [2025-01-10 01:55:19,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 34 remaining) [2025-01-10 01:55:19,105 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:55:19,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:55:19,303 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:55:19,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:55:19,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:55:19,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:55:19 BoogieIcfgContainer [2025-01-10 01:55:19,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:55:19,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:55:19,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:55:19,725 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:55:19,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:54:49" (3/4) ... [2025-01-10 01:55:19,727 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:55:19,732 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:55:19,738 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 01:55:19,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:55:19,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:55:19,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:55:19,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:55:19,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:55:19,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:55:19,808 INFO L158 Benchmark]: Toolchain (without parser) took 30806.25ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.5MB in the beginning and 133.3MB in the end (delta: -10.8MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. [2025-01-10 01:55:19,809 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:55:19,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.27ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 111.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:55:19,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.87ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:55:19,809 INFO L158 Benchmark]: Boogie Preprocessor took 36.72ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:55:19,809 INFO L158 Benchmark]: RCFGBuilder took 403.35ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 92.6MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:55:19,809 INFO L158 Benchmark]: TraceAbstraction took 30089.53ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 92.0MB in the beginning and 138.4MB in the end (delta: -46.4MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2025-01-10 01:55:19,811 INFO L158 Benchmark]: Witness Printer took 80.55ms. Allocated memory is still 293.6MB. Free memory was 138.4MB in the beginning and 133.3MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:55:19,812 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.27ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 111.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.87ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.72ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 403.35ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 92.6MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30089.53ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 92.0MB in the beginning and 138.4MB in the end (delta: -46.4MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Witness Printer took 80.55ms. Allocated memory is still 293.6MB. Free memory was 138.4MB in the beginning and 133.3MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 36, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4166 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4028 mSDsluCounter, 8421 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5843 mSDsCounter, 368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4943 IncrementalHoareTripleChecker+Invalid, 5311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 368 mSolverCounterUnsat, 2578 mSDtfsCounter, 4943 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1972 GetRequests, 1661 SyntacticMatches, 10 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=942occurred in iteration=24, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 1069 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 3014 NumberOfCodeBlocks, 3014 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 2916 ConstructedInterpolants, 0 QuantifiedInterpolants, 10416 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2509 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 51 InterpolantComputations, 26 PerfectInterpolantSequences, 2239/2412 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((((((1 <= y) && (x <= 2147483647)) && (counter <= 4)) && (0 <= r)) && (0 <= (x + 2147483648))) && (2 == q)) && (((__int128) ((long long) 2 * y) + r) <= 2147483647)) && (2 <= a)) && (3 <= counter)) || (((((((((((1 <= y) && (x <= 2147483647)) && (r <= 2147483647)) && (0 <= (x + 2147483648))) && (q == 0)) && (b <= 2147483647)) && (counter == 0)) && (a == 0)) && (y <= 2147483647)) && (0 <= ((__int128) 1073741824 + b))) && (0 <= ((__int128) r + 2147483648)))) || ((((((((((1 <= y) && (x <= 2147483647)) && (0 <= r)) && (a == 1)) && (0 <= (x + 2147483648))) && (q == 1)) && (b <= 2147483647)) && (0 <= ((__int128) b + 2147483648))) && (((__int128) r + y) <= 2147483647)) && (counter == 2))) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((1 <= y) && (x <= 2147483647)) && (r <= 2147483647)) && (((long long) 2 * y) == b)) && (0 <= (x + 2147483648))) && (q == 0)) && (2 == a)) && (b <= r)) && (counter == 2)) || (((((((((1 <= y) && (x <= 2147483647)) && (b == y)) && (a == 1)) && (0 <= (x + 2147483648))) && (q == 0)) && (((__int128) ((long long) 2 * y) + r) <= (2147483647 + ((__int128) 2 * b)))) && (counter == 1)) && (y <= r))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:55:19,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE